Sciweavers

14548 search results - page 2493 / 2910
» The Optimal Path-Matching Problem
Sort
View
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 10 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
AAAI
2007
15 years 9 months ago
Hybrid Inference for Sensor Network Localization Using a Mobile Robot
In this paper, we consider a hybrid solution to the sensor network position inference problem, which combines a real-time filtering system with information from a more expensive,...
Dimitri Marinakis, David Meger, Ioannis M. Rekleit...
DLOG
2008
15 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
15 years 8 months ago
Search decisions for teams of automata
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
Dimitar Baronov, John Baillieul
« Prev « First page 2493 / 2910 Last » Next »