2218 search results - page 260 / 444 » Testing Expressibility Is Hard |
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
CP
1997
Springer
14 years 1 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
VLSID
1996
IEEE
14 years 1 months ago
1996
IEEE
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
The aim of this study is to design a controller based on model predictive control (MPC) theory to smooth wind power generation along with the controlled storage of the wind energy ...