2796 search results - page 214 / 560 » The coolest path problem |
162
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
150
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
154
click to vote
IJFCS
1998
15 years 6 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
210
click to vote
ESWS
2011
Springer
14 years 10 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
189
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...