Sciweavers

2861 search results - page 304 / 573
» Constraint Programming
Sort
View
CORR
2011
Springer
173views Education» more  CORR 2011»
15 years 1 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
SASO
2008
IEEE
16 years 28 days ago
Cells Are Plausible Targets for High-Level Spatial Languages
—High level languages greatly increase the power of a programmer at the cost of programs that consume more s than those written at a lower level of abstraction. This inefficienc...
Jacob Beal, Jonathan Bachrach
SAC
1994
ACM
15 years 10 months ago
Extending a parallel CLP language to support the development of multi-agent systems
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
Panagiotis Stamatopoulos, Dimitris Margaritis, Con...
CP
2009
Springer
16 years 7 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...
ICALP
2010
Springer
15 years 11 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström