Sciweavers

4934 search results - page 178 / 987
» complexity 2008
Sort
View
TCAD
2008
82views more  TCAD 2008»
15 years 4 months ago
A Compositional Method With Failure-Preserving Abstraction for Asynchronous Design Verification
ion for Asynchronous Design Verification Hao Zheng, Member, IEEE, Jared Ahrens, Tian Xia, Member, IEEE This paper presents a compositional method with preserving abstraction for sc...
Hao Zheng, Jared Ahrens, Tian Xia
125
Voted
FORTE
2008
15 years 6 months ago
Protocol Modeling with Model Program Composition
Designing and interoperability testing of distributed, application-level network protocols is complex. Windows, for example, supports currently more than 200 protocols, ranging fro...
Margus Veanes, Wolfram Schulte
SCHOLARPEDIA
2008
122views more  SCHOLARPEDIA 2008»
15 years 3 months ago
Calogero-Moser system
ABSTRACT. We discuss a special eigenstate of the quantized periodic CalogeroMoser system associated to a root system. This state has the property that its eigenfunctions, when rega...
Francesco Calogero
DM
2008
86views more  DM 2008»
15 years 4 months ago
"Catalan traffic" and integrals on the Grassmannian of lines
One proves that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [7] (see also [10]), are top intersection numbers in the cohomology ring of...
Taíse Santiago Costa Oliveira
DAM
2007
67views more  DAM 2007»
15 years 4 months ago
The state of SAT
The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the cu...
Henry A. Kautz, Bart Selman