6740 search results - page 1066 / 1348 » An s -Hamiltonian Line Graph Problem |
209
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
188
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
181
click to vote
IJCAI
2007
15 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
170
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
284
click to vote
WAE
2001
15 years 8 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...