Sciweavers

263 search results - page 22 / 53
» Path partitions of hypercubes
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 8 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
JAIR
2008
107views more  JAIR 2008»
13 years 8 months ago
Exploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Malcolm Ross Kinsella Ryan
AUSAI
2008
Springer
13 years 10 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
EJWCN
2010
115views more  EJWCN 2010»
13 years 3 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
TOG
2010
134views more  TOG 2010»
13 years 3 months ago
Unbiased, adaptive stochastic sampling for rendering inhomogeneous participating media
Realistic rendering of participating media is one of the major subjects in computer graphics. Monte Carlo techniques are widely used for realistic rendering because they provide u...
Yonghao Yue, Kei Iwasaki, Bing-Yu Chen, Yoshinori ...