1051 search results - page 174 / 211 » Foundations of Constraint Satisfaction |
ICCAD
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper presents an efficient statistical design methodology that allows simultaneous sizing for performance and optimization for yield and robustness of analog circuits. The s...
AMET
1998
Springer
14 years 2 months ago
1998
Springer
Software agents help automate a variety of tasks including those involved in buying and selling products over the Internet. Although shopping agents provide convenience for consume...
ECP
1997
Springer
14 years 2 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
HICSS
1994
IEEE
14 years 2 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
EVOW
2010
Springer
14 years 1 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...