461 search results - page 86 / 93 » Component-Based Answer Set Programming |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
ICSOC
2010
Springer
14 years 8 months ago
2010
Springer
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...
TIT
2011
14 years 4 months ago
2011
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...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
78
Voted
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...