434 search results - page 48 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
AAAI
2000
15 years 1 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
128
click to vote
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
113
click to vote
ESWS
2011
Springer
14 years 3 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...
193
click to vote
CRV
2011
IEEE
13 years 11 months ago
2011
IEEE
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
100
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...