2446 search results - page 154 / 490 » Choiceless Polynomial Time |
127
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--Fiber-optic networks are vulnerable to natural disasters, such as tornadoes or earthquakes, as well as to physical failures, such as an anchor cutting underwater fiber ca...
JCSS
2008
15 years 27 days ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
105
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
DAC
1999
ACM
16 years 1 months ago
1999
ACM
The concept of improving the timing behavior of a circuit by relocating registers is called retiming and was first presented by Leiserson and Saxe. They showed that the problem of...
189
click to vote
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. ...