Sciweavers

789 search results - page 78 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
115
Voted
GECCO
2008
Springer
165views Optimization» more  GECCO 2008»
15 years 4 months ago
Dual-population genetic algorithm for nonstationary optimization
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
Taejin Park, Ri Choe, Kwang Ryel Ryu
DAC
2008
ACM
16 years 4 months ago
A progressive-ILP based routing algorithm for cross-referencing biochips
Due to recent advances in microfluidics technology, digital microfluidic biochips and their associated CAD problems have gained much attention, most of which has been devoted to d...
Ping-Hung Yuh, Sachin S. Sapatnekar, Chia-Lin Yang...
113
Voted
AAAI
1998
15 years 4 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CORR
2011
Springer
208views Education» more  CORR 2011»
14 years 10 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
ATAL
2008
Springer
15 years 5 months ago
Multi-agent plan diagnosis and negotiated repair
In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible ...
Huib Aldewereld, Pieter Buzing, Geert Jonker