Sciweavers

1309 search results - page 155 / 262
» Approaching Optimality for Solving SDD Linear Systems
Sort
View
ECAI
1998
Springer
15 years 11 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
PPSN
2000
Springer
15 years 10 months ago
Towards Automatic Domain Knowledge Extraction for Evolutionary Heuristics
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
Márk Jelasity
FOCM
2007
94views more  FOCM 2007»
15 years 6 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 4 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
NIPS
2001
15 years 8 months ago
Multiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
Carlos Guestrin, Daphne Koller, Ronald Parr