2252 search results - page 119 / 451 » Lower Bounds for Dynamic Algorithms |
159
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
121
click to vote
EMSOFT
2007
Springer
15 years 9 months ago
2007
Springer
The design of safety-critical systems has typically adopted static techniques to simplify error detection and fault tolerance. However, economic pressure to reduce costs is exposi...
153
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
128
click to vote
ISORC
2005
IEEE
15 years 9 months ago
2005
IEEE
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
109
click to vote
SOFSEM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...