594 search results - page 65 / 119 » Travelling Miser Problem |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
COGSCI
2010
13 years 8 months ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
MP
2006
13 years 7 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
ALGORITHMICA
2005
13 years 7 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
CONCURRENCY
2000
13 years 7 months ago
2000
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...