100 search results - page 8 / 20 » New complexity results for time-constrained dynamical optima... |
106
click to vote
FITRAMEN
2008
15 years 2 months ago
2008
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
135
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
110
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
109
click to vote
ATMOS
2007
15 years 2 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
136
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...