Sciweavers

4565 search results - page 533 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
GLOBECOM
2007
IEEE
15 years 10 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 10 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
ATAL
2007
Springer
15 years 10 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
154
Voted
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 10 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
ICRA
2005
IEEE
126views Robotics» more  ICRA 2005»
15 years 9 months ago
Global A-Optimal Robot Exploration in SLAM
— It is well-known that the Kalman filter for simultaneous localization and mapping (SLAM) converges to a fully correlated map in the limit of infinite time and data [1]. Howev...
Robert Sim, Nicholas Roy