Sciweavers

298 search results - page 16 / 60
» Abstract Models of Transfinite Reductions
Sort
View
SPIN
2000
Springer
15 years 3 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
117
Voted
DFT
2006
IEEE
99views VLSI» more  DFT 2006»
15 years 5 months ago
Error Tolerance of DNA Self-Assembly by Monomer Concentration Control
Abstract— This paper proposes the control of monomer concentration as a novel improvement of the kinetic Tile Assembly Model (kTAM) to reduce the error rate in DNA selfassembly. ...
Byunghyun Jang, Yong-Bin Kim, Fabrizio Lombardi
TNN
2008
105views more  TNN 2008»
14 years 11 months ago
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
Shuiwang Ji, Jieping Ye
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
15 years 6 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
RTA
2005
Springer
15 years 5 months ago
Universal Algebra for Termination of Higher-Order Rewriting
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
Makoto Hamana