51 search results - page 9 / 11 » The Light-Path Less Traveled |
WSNA
2003
ACM
13 years 11 months ago
2003
ACM
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
EMO
2001
Springer
13 years 10 months ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
AISB
1994
Springer
13 years 10 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
IICAI
2003
13 years 7 months ago
2003
Abstract: Democratic societies throughout the world, it appears, are facing a new type of threat dubbed "asymmetric threat." In this new threat environment the world gove...
AAAI
1998
13 years 7 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...