4524 search results - page 888 / 905 » The Complexity of Global Constraints |
UAI
1997
13 years 9 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
AAAI
1996
13 years 9 months ago
1996
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
IJCAI
1989
13 years 9 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
BIBE
2010
IEEE
13 years 9 months ago
2010
IEEE
Studies of interactions between protein domains and ligands are important in many aspects such as cellular signaling and regulation. In this work, we applied a three-stage knowledg...
DAC
2010
ACM
13 years 9 months ago
2010
ACM
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...