Sciweavers

435 search results - page 30 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
15 years 9 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
152
Voted
PPSN
2004
Springer
15 years 9 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta
GLOBECOM
2009
IEEE
15 years 7 months ago
Near-ML Detection over a Reduced Dimension Hypersphere
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer
CIAC
2006
Springer
84views Algorithms» more  CIAC 2006»
15 years 7 months ago
In-Place Randomized Slope Selection
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
Henrik Blunck, Jan Vahrenhold
116
Voted
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
15 years 3 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh