335 search results - page 31 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
133
Voted
AMC
2006
15 years 3 months ago
2006
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
107
click to vote
TCOM
2008
15 years 3 months ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
142
Voted
SIAMCOMP
2000
15 years 3 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
140
Voted
PAMI
2010
15 years 1 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
138
Voted
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We present a novel approach to compute collisionfree paths for multiple robots subject to local coordination constraints. More specifically, given a set of robots, the...