360 search results - page 35 / 72 » Constraint Checking with Partial Information |
PLDI
2003
ACM
14 years 27 days ago
2003
ACM
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
KR
2010
Springer
14 years 12 days ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
APWEB
2011
Springer
13 years 2 months ago
2011
Springer
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...