Sciweavers

1589 search results - page 150 / 318
» Multiple-Goal Heuristic Search
Sort
View
JMLR
2006
145views more  JMLR 2006»
13 years 10 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
ANOR
2005
93views more  ANOR 2005»
13 years 10 months ago
Looking Ahead with the Pilot Method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...
Stefan Voß, Andreas Fink, Cees Duin
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
13 years 5 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
GECCO
2008
Springer
180views Optimization» more  GECCO 2008»
13 years 11 months ago
An agent-based collaborative evolutionary model for multimodal optimization
A novel approach to multimodal optimization called Roaming Agent-Based Collaborative Evolutionary Model (RACE) combining several evolutionary techniques with agent-based modeling ...
Rodica Ioana Lung, Camelia Chira, Dumitru Dumitres...
RP
2009
Springer
121views Control Systems» more  RP 2009»
14 years 4 months ago
Games with Opacity Condition
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
Bastien Maubert, Sophie Pinchinat