Sciweavers

4117 search results - page 7 / 824
» On the Satisfiability of Complex Constraints
Sort
View
MFCS
2010
Springer
14 years 7 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
ICECCS
2005
IEEE
87views Hardware» more  ICECCS 2005»
15 years 3 months ago
Modeling Diverse and Complex Interactions Enabled by Middleware as Connectors in Software Architectures
Middleware enables distributed components to interact with each others in diverse and complex manners. Such interactions should be modeled at architecture level for controlling th...
Yali Zhu
IJCV
2000
110views more  IJCV 2000»
14 years 9 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli
KR
2004
Springer
15 years 2 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
SPLC
2008
14 years 10 months ago
Do SAT Solvers Make Good Configurators?
A configuration process is about finding a configuration, a setting, that satisfies the requirements given by the user and constraints imposed by the domain. Feature models are us...
Mikolás Janota