Sciweavers

680 search results - page 4 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
AAAI
2007
13 years 10 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 2 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
KR
2010
Springer
14 years 16 days ago
Finding Explanations of Inconsistency in Multi-Context Systems
We provide two approaches for explaining inconsistency in multi-context systems, where decentralized and heterogeneous system parts interact via nonmonotonic bridge rules. Inconsi...
Thomas Eiter, Michael Fink, Peter Schüller, A...
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo
JMLR
2012
11 years 10 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell