Sciweavers

387 search results - page 59 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 8 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...
IJCAI
2007
13 years 10 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 9 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
LICS
2007
IEEE
14 years 2 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
AIIA
1999
Springer
14 years 28 days ago
An Implementation for Abductive Logic Agents
This paper presents thedistributed implementationof ALIAS, an architecture composed of several cooperating intelligent agents. This system is particularly suited to solve problems ...
Anna Ciampolini, Evelina Lamma, Paola Mello, Cesar...