706 search results - page 34 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
EOR
2006
13 years 7 months ago
2006
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is ...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...