Sciweavers

1550 search results - page 282 / 310
» Benchmarking for Graph Transformation
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
PRDC
2009
IEEE
14 years 2 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...
FSTTCS
2009
Springer
14 years 2 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
INFOCOM
2008
IEEE
14 years 1 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
ICC
2007
IEEE
14 years 1 months ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...