Sciweavers

443 search results - page 82 / 89
» SAT-Based Answer Set Programming
Sort
View
CP
2003
Springer
14 years 29 days ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
AAAI
2007
13 years 10 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
SPLC
2000
13 years 9 months ago
Value-based software engineering (VBSE)
: We consider a set of programs a family when it pays to look at their common aspects before looking at their differences. For commercial software developers the implications are t...
Stuart R. Faulk, Robert R. Harmon, David Raffo
ICSOC
2010
Springer
13 years 6 months ago
Service Discovery Using Communication Fingerprints
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
Olivia Oanea, Jan Sürmeli, Karsten Wolf
TIT
2011
209views more  TIT 2011»
13 years 2 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...