Sciweavers

52 search results - page 2 / 11
» Computing Minimal Diagnoses by Greedy Stochastic Search
Sort
View
AIPS
2008
13 years 7 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
13 years 9 months ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
DAC
1994
ACM
13 years 9 months ago
Stochastic Optimization Approach to Transistor Sizing for CMOS VLSI Circuits
A stochastic global optimization approach is presented for transistor sizing in CMOS VLSI circuits. This is a direct search strategy for the best design among feasible ones, with ...
Sharad Mehrotra, Paul D. Franzon, Wentai Liu
ICASSP
2011
IEEE
12 years 9 months ago
Sparse common spatial patterns in brain computer interface applications
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Fikri Goksu, Nuri Firat Ince, Ahmed H. Tewfik
EVOW
2008
Springer
13 years 7 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...