4110 search results - page 53 / 822 » Efficient algorithms for the 2-gathering problem |
139
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
120
click to vote
UAI
2004
15 years 5 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
130
click to vote
IJRR
2010
15 years 1 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
121
click to vote
ICPP
1998
IEEE
15 years 8 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
143
Voted
ESWA
2010
15 years 1 months ago
2010
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...