1632 search results - page 221 / 327 » Sublinear Time Algorithms for Metric Space Problems |
126
click to vote
JAR
2000
15 years 3 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
135
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
In online, dynamic environments, the services requested by consumers may not be readily served by the providers. This requires the service consumers and providers to negotiate the...
139
click to vote
ISDA
2008
IEEE
15 years 10 months ago
2008
IEEE
Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
114
click to vote
ISCA
2006
IEEE
15 years 10 months ago
2006
IEEE
A simple and low-cost approach to supporting snoopy cache coherence is to logically embed a unidirectional ring in the network of a multiprocessor, and use it to transfer snoop me...