Sciweavers

1004 search results - page 112 / 201
» Product representations of polynomials
Sort
View
TASE
2010
IEEE
14 years 4 months ago
A Semantic Feature Model in Concurrent Engineering
Concurrent engineering (CE) is a methodology applied to product lifecycle development so that high quality, well designed products can be provided at lower prices and in less time....
Yong-Jin Liu, Kam-Lung Lai, Gang Dai, Matthew Ming...
FOCI
2007
IEEE
15 years 4 months ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...
GBRPR
2007
Springer
15 years 4 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
SAT
2007
Springer
184views Hardware» more  SAT 2007»
15 years 3 months ago
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
Gilles Audemard, Lakhdar Sais
CP
2004
Springer
15 years 3 months ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...