Sciweavers

3055 search results - page 162 / 611
» Randomized Search Trees
Sort
View
CORR
2006
Springer
147views Education» more  CORR 2006»
13 years 10 months ago
ARQ Diversity in Fading Random Access Channels
A cross-layer optimization approach is adopted for the design of symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical la...
Young-Han Nam, Praveen Kumar Gopala, Hesham El Gam...
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 10 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
TAINN
2005
Springer
14 years 4 months ago
An Evolutionary Local Search Algorithm for the Satisfiability Problem
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
Levent Aksoy, Ece Olcay Gunes
ICIP
2007
IEEE
14 years 5 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 5 months ago
The Cost of Reality: Effects of Real-World Factors on Multi-Robot Search
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
Jim Pugh, Alcherio Martinoli