150 search results - page 15 / 30 » Dynamically Ordered Probabilistic Choice Logic Programming |
ROBOCUP
2000
Springer
13 years 11 months ago
2000
Springer
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
SC
2009
ACM
14 years 2 months ago
2009
ACM
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
AIPS
2008
13 years 10 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
APPINF
2003
13 years 9 months ago
2003
We present an application prototype of dynamic knowledge representation programmed in LUPS (a language for updating logic programs). This is a case study to model intelligent agen...
APWEB
2006
Springer
13 years 11 months ago
2006
Springer
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...