976 search results - page 63 / 196 » The Complexity of Timetable Construction Problems |
ESA
2000
Springer
14 years 21 days ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
AIPS
2007
13 years 11 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
OL
2011
13 years 4 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
GD
2005
Springer
14 years 2 months ago
2005
Springer
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...