Sciweavers

1688 search results - page 9 / 338
» The Complexity of Rationalizing Matchings
Sort
View
LPNMR
1995
Springer
13 years 11 months ago
Skeptical Rational Extensions
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
Artur Mikitiuk, Miroslaw Truszczynski
ACOM
2004
Springer
13 years 11 months ago
A Model of Rational Agency for Communicating Agents
The Cognitive Agent Specification Language (CASL) is a framework for specifying and verifying complex communicating multiagent systems. In this paper, we develop an extended versi...
Shakil M. Khan, Yves Lespérance
AUTOMATICA
2006
112views more  AUTOMATICA 2006»
13 years 7 months ago
Joint identification of plant rational models and noise distribution functions using binary-valued observations
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and limitations for systems with limited sensor inform...
Le Yi Wang, Gang George Yin, Ji-Feng Zhang
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
13 years 11 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
HICSS
2003
IEEE
123views Biometrics» more  HICSS 2003»
14 years 28 days ago
Issues in Rational Planning in Multi-Agent Settings
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents operating in multi-agent environments. We use the...
Piotr J. Gmytrasiewicz