72 search results - page 13 / 15 » ecai 2000 |
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
Knowledge-based systems (KBS) are not necessarily based on well-defined ontologies. In particular it is possible to build KBS for classification problems, where there is little con...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
As the field of agent-based systems continues to expand rapidly, one of the most significant problems lies in being able to compare and evaluate the relative benefits and disad...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be ...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of t...