1172 search results - page 115 / 235 » Path Algorithms on Regular Graphs |
102
Voted
GEM
2007
15 years 2 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
IJCAI
2007
15 years 2 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
115
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
103
Voted
IJMC
2006
15 years 17 days ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
CLEAR
2006
Springer
15 years 4 months ago
2006
Springer
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...