Sciweavers

346 search results - page 63 / 70
» Logical omniscience as a computational complexity problem
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Pragmatic-strategic reputation-based decisions in BDI agents
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
Isaac Pinyol, Jordi Sabater-Mir
FSTTCS
2009
Springer
14 years 2 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
SEKE
2007
Springer
14 years 1 months ago
Managing XML Versions and Replicas in a P2P Context
Peer-to-Peer (P2P) systems seek to provide sharing of computational resources, which may be duplicated or versioned over several peers. Duplicate resources (i.e. replicas) are the...
Deise de Brum Saccol, Nina Edelweiss, Renata de Ma...
FECS
2006
159views Education» more  FECS 2006»
13 years 9 months ago
Evolving Mathematical Functions with Genetic Algorithms - A Team Project on Artificial Intelligence
- In contrast to most of the senior level Artificial Intelligence (AI) courses where AI is taught in the jargon of theoretical computer science with crowd of complex matrix algebra...
Zhiguang Xu, Chris Neasbitt, Jared Summers, Bill C...
ML
2008
ACM
13 years 7 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer