Sciweavers

5153 search results - page 282 / 1031
» Introduction to Randomized Algorithms
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
15 years 3 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
CEC
2008
IEEE
15 years 10 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
IPPS
2007
IEEE
15 years 10 months ago
Dynamic Load-Balancing and High Performance Communication in Jcluster
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...
Bao-Yin Zhang, Zeyao Mo, Guangwen Yang, Weimin Zhe...
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
15 years 5 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha
ECCV
2008
Springer
16 years 5 months ago
Robust Multiple Structures Estimation with J-Linkage
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
Roberto Toldo, Andrea Fusiello