2796 search results - page 99 / 560 » The coolest path problem |
119
click to vote
COR
2007
15 years 4 months ago
2007
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
141
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
152
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
148
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
114
Voted
MPC
1998
Springer
15 years 9 months ago
1998
Springer
