Sciweavers

3055 search results - page 249 / 611
» Randomized Search Trees
Sort
View
TMC
2002
118views more  TMC 2002»
15 years 2 months ago
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two importan...
Yu-Chee Tseng, Chih-Min Chao
INFOCOM
2009
IEEE
15 years 9 months ago
Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
Stratis Ioannidis, Peter Marbach
AI
2003
Springer
15 years 8 months ago
Iterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Kevin Smyth, Holger H. Hoos, Thomas Stützle
CSR
2010
Springer
15 years 7 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
ICCAD
1999
IEEE
78views Hardware» more  ICCAD 1999»
15 years 7 months ago
Probabilistic state space search
This paper describes a probabilistic approach to state space search. The presented method applies a ranking of the design states according to their probability of reaching a given...
Andreas Kuehlmann, Kenneth L. McMillan, Robert K. ...