Sciweavers

57 search results - page 11 / 12
» Place-Boundedness for Vector Addition Systems with one zero-...
Sort
View
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
13 years 8 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 5 months ago
Decisive Markov Chains
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
GLVLSI
2007
IEEE
194views VLSI» more  GLVLSI 2007»
13 years 9 months ago
Probabilistic maximum error modeling for unreliable logic circuits
Reliability modeling and evaluation is expected to be one of the major issues in emerging nano-devices and beyond 22nm CMOS. Such devices would have inherent propensity for gate f...
Karthikeyan Lingasubramanian, Sanjukta Bhanja
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
13 years 6 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
4OR
2010
137views more  4OR 2010»
13 years 5 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...