Sciweavers

11 search results - page 1 / 3
» An Exponential Time Space Speedup For Resolution
Sort
View
ECCC
2007
99views more  ECCC 2007»
13 years 4 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
CJ
2002
67views more  CJ 2002»
13 years 4 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 6 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
SCALESPACE
1999
Springer
13 years 9 months ago
A Scale-Space Based Approach for Deformable Contour Optimization
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
Yusuf Sinan Akgul, Chandra Kambhamettu
IFIPTCS
2000
13 years 8 months ago
Real-Time Language Recognition by Alternating Cellular Automata
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
Thomas Buchholz, Andreas Klein, Martin Kutrib