Sciweavers

693 search results - page 70 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
14 years 7 days ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
ATAL
2006
Springer
13 years 11 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
EDBT
2008
ACM
85views Database» more  EDBT 2008»
14 years 8 months ago
Optimizing on-demand data broadcast scheduling in pervasive environments
Data dissemination in pervasive environments is often accomplished by on-demand broadcasting. The time critical nature of the data requests plays an important role in scheduling t...
Rinku Dewri, Indrakshi Ray, Indrajit Ray, Darrell ...
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park