4865 search results - page 578 / 973 » The Complexity of Graph Connectivity |
187
click to vote
VR
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
186
click to vote
SOFSEM
2007
Springer
16 years 29 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
184
click to vote
ATAL
2005
Springer
16 years 11 days ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
170
click to vote
CP
2005
Springer
16 years 11 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
172
click to vote
EUROGP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...