Sciweavers

1844 search results - page 27 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
EDBT
2009
ACM
112views Database» more  EDBT 2009»
15 years 3 months ago
GCIP: exploiting the generation and optimization of integration processes
As a result of the changing scope of data management towards the management of highly distributed systems and applications, integration processes have gained in imporuch integrati...
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 4 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
CPAIOR
2004
Springer
15 years 2 months ago
A Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Sébastien Sorlin, Christine Solnon
JMLR
2012
13 years 1 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
AAAI
1998
15 years 15 days ago
Qualitative Simulation as a Temporally-extended Constraint Satisfaction Problem
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
Daniel J. Clancy, Benjamin Kuipers