Sciweavers

1054 search results - page 150 / 211
» Capacitated Domination Problem
Sort
View
69
Voted
AAAI
2008
15 years 1 months ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
AAAI
2008
15 years 1 months ago
Learning and Inference with Constraints
Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...
Ming-Wei Chang, Lev-Arie Ratinov, Nicholas Rizzolo...
AAAI
2010
15 years 20 days ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
IJCAI
2007
15 years 19 days ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell
IPCO
2007
143views Optimization» more  IPCO 2007»
15 years 19 days ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea