Sciweavers

2905 search results - page 246 / 581
» Formal Memetic Algorithms
Sort
View
SMC
2007
IEEE
134views Control Systems» more  SMC 2007»
15 years 5 months ago
A Petri net-based approach to QoS-aware configuration for web services
: With the development of enterprise-wide and cross-enterprise application integration and interoperation towards web service, web service providers try to not only fulfill the fun...
PengCheng Xiong, Yushun Fan, MengChu Zhou
SMI
2007
IEEE
129views Image Analysis» more  SMI 2007»
15 years 5 months ago
Localized Homology
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
Afra Zomorodian, Gunnar Carlsson
CAV
2007
Springer
98views Hardware» more  CAV 2007»
15 years 5 months ago
UPPAAL-Tiga: Time for Playing Games!
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
Gerd Behrmann, Agnès Cougnard, Alexandre Da...
FMCAD
2007
Springer
15 years 5 months 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
78
Voted
FMCAD
2007
Springer
15 years 5 months ago
Induction in CEGAR for Detecting Counterexamples
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
Chao Wang, Aarti Gupta, Franjo Ivancic