Sciweavers

4229 search results - page 148 / 846
» On the Optimality of Spiral Search
Sort
View
ICASSP
2011
IEEE
14 years 5 months ago
Microphone position optimization for planar superdirective beamforming
The performance of a fixed beamformer highly depends on the position of the microphones in the array. In this paper, different heuristic optimisation approaches for arbitrary pla...
Ina Kodrasi, Thomas Rohdenburg, Simon Doclo
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 5 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson
IJCAI
2007
15 years 2 months ago
Symmetric Component Caching
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
Matthew Kitching, Fahiem Bacchus
TEC
2002
163views more  TEC 2002»
15 years 1 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
CPAIOR
2007
Springer
15 years 7 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter