Sciweavers

1662 search results - page 193 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
DOCENG
2006
ACM
14 years 2 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
ILP
2007
Springer
14 years 3 months ago
Learning to Assign Degrees of Belief in Relational Domains
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
Frédéric Koriche
ATAL
2008
Springer
13 years 11 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
INFOSCALE
2007
ACM
13 years 10 months ago
An agent-based decentralised process management framework for web service composition
Web service composition provision which requires efficient coordination of the execution of component services is a critical issue in service-oriented computing. Nowadays, BPEL4WS...
Jun Yan, Phillip Pidgeon, Aneesh Krishna, Jianming...
AAAI
2008
13 years 10 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski