1088 search results - page 6 / 218 » Independence of Negative Constraints |
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
LPAR
2005
Springer
14 years 26 days ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
COLOGNETWENTE
2008
13 years 8 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...