Sciweavers

1300 search results - page 95 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
AAAI
2007
15 years 13 days ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
AGI
2008
14 years 11 months ago
Learning from Inconsistencies in an Integrated Cognitive Architecture
Whereas symbol
Kai-Uwe Kühnberger, Peter Geibel, Helmar Gust...
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
14 years 5 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
15 years 10 months ago
Leveraging aggregate constraints for deduplication
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...
CEC
2010
IEEE
14 years 6 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...