Sciweavers

789 search results - page 83 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
JVM
2004
133views Education» more  JVM 2004»
15 years 4 months ago
Towards Virtual Networks for Virtual Machine Grid Computing
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
Ananth I. Sundararaj, Peter A. Dinda
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 8 months ago
Reducing the Cost of the Hybrid Evolutionary Algorithm with Image Local Response in Electronic Imaging
Abstract. The paper focuses on the efficiency of the hybrid evolutionary algorithm (HEA) for solving the global optimization problem arising in electronic imaging. The particular v...
Igor V. Maslov
ICML
2009
IEEE
16 years 4 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
139
Voted
ATAL
2010
Springer
15 years 4 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...