Sciweavers

427 search results - page 6 / 86
» A Graph Based Synthesis Algorithm for Solving CSPs
Sort
View
DAC
1997
ACM
13 years 12 months ago
A Graph-Based Synthesis Algorithm for AND/XOR Networks
In this paper, we introduce a Shared Multiple Rooted XORbased Decomposition Diagram XORDD to represent functions with multiple outputs. Based on the XORDD representation, we dev...
Yibin Ye, Kaushik Roy
AMAI
1999
Springer
13 years 7 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
IJON
2000
80views more  IJON 2000»
13 years 7 months ago
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...
Ismail Salih, Stanley H. Smith, Derong Liu
AAAI
1997
13 years 9 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
Daniel Frost, Irina Rish, Lluís Vila
SARA
2007
Springer
14 years 1 months ago
DFS-Tree Based Heuristic Search
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
Montserrat Abril, Miguel A. Salido, Federico Barbe...