543 search results - page 83 / 109 » A Multiagent Algorithm for Graph Partitioning |
139
Voted
LOGCOM
1998
15 years 6 days ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
89
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
105
click to vote
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
107
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
107
click to vote
FPGA
1998
ACM
15 years 4 months ago
1998
ACM
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...