434 search results - page 56 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
ATAL
2008
Springer
14 years 11 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...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
86
Voted
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
100
Voted
GIS
2009
ACM
15 years 2 months ago
2009
ACM
This paper proposes a method for generating a Focus+Glue +Context map for Web map services by improving existing fisheye views methods for cartographic data. While many studies h...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...