Abstraction, Reformulation, and Approximation

  title={Abstraction, Reformulation, and Approximation},
  author={B. Choueiry and Toby Walsh and Thomas G. Dietterich},
  booktitle={Lecture Notes in Computer Science},
ion, Reformulation, and Approximation 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings Bearbeitet von Sven Koenig, Robert C Holte 1. Auflage 2002. Taschenbuch. xi, 352 S. Paperback ISBN 978 3 540 43941 7 Format (B x L): 15,5 x 23,5 cm Gewicht: 1140 g Weitere Fachgebiete > EDV, Informatik > Informatik > Logik, Formale Sprachen, Automaten Zu Leseprobe schnell und portofrei erhaltlich bei Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert… 
Synthesis and Abstraction of Constraint Models for Hierarchical Resource Allocation Problems
Algorithms are presented to create synthesised and abstracted models of agents providing a certain resource into a centrally and efficiently solvable optimisation problem and the creation of an abstracted version of this centralised model that reduces its complexity when passing it on to higher layers.
Optimization-based approximate dynamic programming
New reliable algorithms for ADP that use optimization instead of iterative improvement are presented, and homotopy methods that use the sampling bounds to automatically select good approximation features for optimization–based algorithms are proposed.
FAHR: Focused A* Heuristic Recomputation
  • M. McNaughton, C. Urmson
  • Business, Computer Science
    2009 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2009
Focused A* Heuristic Recomputation (FAHR), an enhancement to A* search that can detect and correct large discrepancies between the heuristic cost-to-go estimate and the true cost function, is introduced.
Abstraction and reformulation in artificial intelligence.
  • R. Holte, B. Choueiry
  • Computer Science
    Philosophical transactions of the Royal Society of London. Series B, Biological sciences
  • 2003
This paper contributes in two ways to the aims of this special issue on abstraction. The first is to show that there are compelling reasons motivating the use of abstraction in the purely
An Agent-Based Approach for Coordinated Multi-Provider Service Provisioning
  • M. Calisti
  • Medicine
    Whitestein Series in Software Agent Technologies
  • 2003
A Pricing in Communication Networks examines pricing in Multi-service and Multi-provider Networks using an Auction Based Model and Alternative Approaches for Providers Coordination as a guide.
Study on Multi-requirement Points Vehicle Scheduling Model and Its Swarm Mix Algorithm
Multi-requirement points vehicle scheduling models (MRP-VSM) with detailed freight relation were established and result shows the optimization vehicle route length by swarm mix algorithm is less than modified ACO.
Option Discovery for Autonomous Generation of Symbolic Knowledge
This work empirically demonstrate that the discovered options can be abstracted in an probabilistic symbolic planning model (using the PPDDL language), which allowed the agent to generate symbolic plans to achieve extrinsic goals.