Sciweavers

76 search results - page 5 / 16
» Static Analysis by Policy Iteration on Relational Domains
Sort
View
POLICY
2005
Springer
14 years 25 days ago
Using Linear Temporal Model Checking for Goal-Oriented Policy Refinement Frameworks
Policy refinement is meant to derive lower-level policies from higher-level ones so that these more specific policies are better suited for use in different execution environments...
Javier Rubio-Loyola, Joan Serrat, Marinos Charalam...
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
AIPS
2008
13 years 9 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
ER
2004
Springer
161views Database» more  ER 2004»
14 years 22 days ago
Applying the Application-Based Domain Modeling Approach to UML Structural Views
Being part of domain engineering, domain analysis enables identifying domains and capturing their ontologies in order to assist and guide system developers to design domain-specifi...
Arnon Sturm, Iris Reinhartz-Berger
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone