Sciweavers

3318 search results - page 649 / 664
» The Weak Instance Model
Sort
View
DLOG
2004
13 years 11 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
NSDI
2004
13 years 11 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 11 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
AAAI
2008
13 years 11 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
ECAI
2010
Springer
13 years 11 months ago
ANTIPA: an agent architecture for intelligent information assistance
Abstract. Human users trying to plan and accomplish informationdependent goals in highly dynamic environments with prevalent uncertainty must consult various types of information s...
Jean Oh, Felipe Meneguzzi, Katia P. Sycara