Sciweavers

2725 search results - page 70 / 545
» Constraint Solving for Interpolation
Sort
View
AAAI
1997
14 years 13 days ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
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...
Roberto J. Bayardo Jr., Robert Schrag
MP
2007
75views more  MP 2007»
13 years 10 months ago
Solving maximum-entropy sampling problems using factored masks
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...
Samuel Burer, Jon Lee
ICMCS
2005
IEEE
64views Multimedia» more  ICMCS 2005»
14 years 4 months ago
Reliable video communication with multi-path streaming using MDC
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 ...
Ivan Lee, Ling Guan
AGP
2010
IEEE
14 years 4 months ago
Constraint Logic Programming
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...
Marco Gavanelli, Francesca Rossi
COR
2008
142views more  COR 2008»
13 years 10 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
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...
Luis Gouveia, Ana Paias, Dushyant Sharma