Sciweavers

263 search results - page 39 / 53
» Combinatorial Shape Decomposition
Sort
View
FMCO
2003
Springer
114views Formal Methods» more  FMCO 2003»
15 years 5 months ago
Synchronous Closing and Flow Analysis for Model Checking Timed Systems
Abstract. Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully auto...
Natalia Ioustinova, Natalia Sidorova, Martin Steff...
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
15 years 4 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
EEF
2000
15 years 3 months ago
Distributed and Structured Analysis Approaches to Study Large and Complex Systems
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
Gianfranco Ciardo
89
Voted
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 1 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
GLOBECOM
2008
IEEE
14 years 12 months ago
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
Bin Lin, Pin-Han Ho, Xuemin Shen, Frank Chih-Wei S...