2543 search results - page 114 / 509 » Optimal Ordered Problem Solver |
109
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
118
click to vote
AAAI
2007
15 years 5 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
147
click to vote
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
104
click to vote
LPAR
2010
Springer
15 years 28 days ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
163
click to vote
JMLR
2012
13 years 5 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...