1688 search results - page 77 / 338 » The Complexity of Rationalizing Matchings |
ANCS
2007
ACM
14 years 2 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
ANCS
2007
ACM
14 years 2 months ago
2007
ACM
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
MAAMAW
1994
Springer
14 years 2 months ago
1994
Springer
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
FLAIRS
2003
13 years 11 months ago
2003
Document retrieval in languages with a rich and complex morphology – particularly in terms of derivation and (single-word) composition – suffers from serious performance degra...
AI
1998
Springer
13 years 9 months ago
1998
Springer
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...