Sciweavers

12950 search results - page 180 / 2590
» On Optimal Timed Strategies
Sort
View
UAI
2004
15 years 5 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
IJCAI
1993
15 years 5 months ago
Evolutionary Learning Strategy using Bug-Based Search
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
Hitoshi Iba, Tetsuya Higuchi, Hugo de Garis, Taisu...
IJHPCN
2006
151views more  IJHPCN 2006»
15 years 4 months ago
Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks
: On-demand routing protocols are widely used in mobile ad hoc networks due to their capability of adjusting to frequent network topology changes within acceptable routing overhead...
Zhao Cheng, Wendi B. Heinzelman
CDC
2010
IEEE
108views Control Systems» more  CDC 2010»
14 years 11 months ago
Optimal pursuit of moving targets using dynamic Voronoi diagrams
We consider Voronoi-like partitions for a team of moving targets distributed in the plane, such that each set in this partition is uniquely associated with a particular moving targ...
Efstathios Bakolas, Panagiotis Tsiotras
CC
1999
Springer
107views System Software» more  CC 1999»
15 years 8 months ago
Link-Time Improvement of Scheme Programs
Abstract. Optimizing compilers typically limit the scope of their analyses and optimizations to individual modules. This has two drawbacks: rst, library code cannot be optimized to...
Saumya K. Debray, Robert Muth, Scott A. Watterson