Sciweavers

1001 search results - page 94 / 201
» Testing Formal Dialectic
Sort
View
ECAI
2006
Springer
14 years 25 days ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
FORMATS
2006
Springer
14 years 25 days ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
AICCSA
2001
IEEE
131views Hardware» more  AICCSA 2001»
14 years 25 days ago
Constraint-Based Timetabling-A Case Study
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
Abdulwahed M. Abbas, Edward P. K. Tsang
INFOCOM
1995
IEEE
14 years 21 days ago
Virtual Path Bandwidth Allocation in Multi-User Networks
— We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure account...
Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendaraki...
AAAI
2007
13 years 11 months ago
Fluxplayer: A Successful General Game Player
General Game Playing (GGP) is the art of designing programs that are capable of playing previously unknown games of a wide variety by being told nothing but the rules of the game....
Stephan Schiffel, Michael Thielscher