2647 search results - page 53 / 530 » Solving Term Inequalities |
147
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
156
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
139
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
140
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
156
click to vote
ICCAD
2007
IEEE
16 years 22 days ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...