559 search results - page 67 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
129
Voted
FMCAD
2007
Springer
15 years 9 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
107
Voted
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
124
Voted
IWPC
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
148
Voted
ISDA
2010
IEEE
15 years 22 days ago
2010
IEEE
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
125
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...