2252 search results - page 126 / 451 » Lower Bounds for Dynamic Algorithms |
120
click to vote
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
129
Voted
HYBRID
2010
Springer
15 years 10 months ago
2010
Springer
One of the oldest problems in the study of dynamical systems is the calculation of an optimal control. Though the determination of a numerical solution for the general nonconvex o...
111
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
139
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: High-throughput shotgun proteomics data contain a significant number of spectra from non-peptide ions or spectra of too poor quality to obtain highly confident peptide...
150
click to vote
WDAG
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...