Sciweavers

2370 search results - page 154 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
14 years 12 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
UAI
2008
14 years 11 months ago
CORL: A Continuous-state Offset-dynamics Reinforcement Learner
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...
Emma Brunskill, Bethany R. Leffler, Lihong Li, Mic...
AAAI
2006
14 years 11 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
AIPS
2003
14 years 11 months ago
Quality and Utility - Towards a Generalization of Deadline and Anytime Scheduling
Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
Thomas Schwarzfischer
CEC
2010
IEEE
14 years 11 months ago
AGE-P: Moving from concept to technical realization
Even though evolutionary algorithms have been applied to a vast number of problems, they are still not always applicable. As an example, this paper briefly discusses smart applianc...
Stefan Goldmann, Ralf Salomon