Sciweavers

664 search results - page 76 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
AAAI
1992
14 years 11 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
14 years 11 months ago
Evolutionary path planner for UAVs in realistic environments
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
Jesús Manuel de la Cruz, Eva Besada-Portas,...
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 11 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
14 years 11 months ago
Protein-protein functional association prediction using genetic programming
Determining if a group of proteins are functionally associated among themselves is an open problem in molecular biology. Within our long term goal of applying Genetic Programming ...
Beatriz García, Ricardo Aler, Agapito Ledez...
ICML
2010
IEEE
14 years 11 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...