18306 search results - page 368 / 3662 » Algorithmics in Exponential Time |
280
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
193
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
168
click to vote
AICCSA
2007
IEEE
16 years 1 months ago
2007
IEEE
Implementation of current real time services (of which one of the more important is Voice over IP) on the current Internet face many obstacles, among them the issue of routing. Qu...
187
click to vote
IJCAI
2003
15 years 8 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
200
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...