Sciweavers

2109 search results - page 235 / 422
» Solving Necklace Constraint Problems
Sort
View
CP
1998
Springer
15 years 10 months ago
Error-Correcting Source Code
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
Yasuhiro Ajiro, Kazunori Ueda, Kenta Cho
144
Voted
CPAIOR
2008
Springer
15 years 7 months ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
181
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 7 days ago
Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
Manuel Förster, Bettina Bickel, Bernd Hardung...
ICN
2001
Springer
15 years 10 months ago
Backbone Network Design with QoS Requirements
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
Hong-Hsu Yen, Frank Yeong-Sung Lin
FMCAD
2007
Springer
16 years 8 days ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
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...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton