Sciweavers

14548 search results - page 374 / 2910
» The Optimal Path-Matching Problem
Sort
View
JAIR
2010
77views more  JAIR 2010»
15 years 5 months ago
Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
Because an agent’s resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such a...
E. H. Durfee Wu, Edmund H. Durfee
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
16 years 2 days ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
15 years 7 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
EAAI
2007
154views more  EAAI 2007»
15 years 6 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Adaptive Bound Optimization for Online Convex Optimization
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
H. Brendan McMahan, Matthew J. Streeter