Sciweavers

2861 search results - page 399 / 573
» Constraint Programming
Sort
View
85
Voted
ANOR
2004
116views more  ANOR 2004»
14 years 10 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ECAI
2004
Springer
15 years 3 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 2 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
CPAIOR
2010
Springer
15 years 1 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
TSE
2008
101views more  TSE 2008»
14 years 10 months ago
DeMIMA: A Multilayered Approach for Design Pattern Identification
Design patterns are important in object-oriented programming because they offer design motifs, elegant solutions to recurrent design problems, which improve the quality of software...
Yann-Gaël Guéhéneuc, Giuliano A...