2725 search results - page 70 / 545 » Constraint Solving for Interpolation |
85
Voted
AAAI
1997
15 years 2 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
80
Voted
MP
2007
15 years 6 days ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
87
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Video streaming demands high data rates and hard delay constraints, and it raises several challenges on today’s packet-based and best-effort internet. In this paper, we propose ...
193
Voted
AGP
2010
IEEE
15 years 5 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
147
click to vote
COR
2008
15 years 8 days ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...