Sciweavers

288 search results - page 11 / 58
» Inclusion Problems for Patterns with a Bounded Number of Var...
Sort
View
SAT
2007
Springer
99views Hardware» more  SAT 2007»
14 years 2 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...
CSR
2007
Springer
14 years 3 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
EAAI
2010
86views more  EAAI 2010»
13 years 8 months ago
Resolution of nonlinear interval problems using symbolic interval arithmetic
: An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] [a, b...
Luc Jaulin, Gilles Chabert
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
14 years 2 months ago
Detecting Patterns of Change Using Enhanced Parallel Coordinates Visualization
Analyzing data to find trends, correlations, and stable patterns is an important problem for many industrial applications. In this paper, we propose a new technique based on paral...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Andreas Sc...
OSN
2007
185views more  OSN 2007»
13 years 8 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane