Sciweavers

3333 search results - page 495 / 667
» Optimal Power-Down Strategies
Sort
View
198
Voted
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
15 years 11 months ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard
164
Voted
IAT
2009
IEEE
15 years 11 months ago
Multi-a(ge)nt Graph Patrolling and Partitioning
We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolli...
Yotam Elor, Alfred M. Bruckstein
ESAS
2006
Springer
15 years 10 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 10 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 10 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....