Sciweavers

952 search results - page 38 / 191
» Computational complexity of stochastic programming problems
Sort
View
SAMOS
2005
Springer
14 years 10 months ago
Modeling NoC Architectures by Means of Deterministic and Stochastic Petri Nets
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Chi...
Holger Blume, Thorsten von Sydow, Daniel Becker, T...
JSA
2007
123views more  JSA 2007»
14 years 5 months ago
Application of deterministic and stochastic Petri-Nets for performance modeling of NoC architectures
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Ch...
Holger Blume, Thorsten von Sydow, Daniel Becker, T...
FCCM
2008
IEEE
212views VLSI» more  FCCM 2008»
14 years 11 months ago
Map-reduce as a Programming Model for Custom Computing Machines
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
Jackson H. C. Yeung, C. C. Tsang, Kuen Hung Tsoi, ...
FDL
2004
IEEE
14 years 9 months ago
A Functional Programming Framework of Heterogeneous Model of Computation for System Design
System-on-Chip (SOC) and other complex distributed hardware/software systems contain heterogeneous components such as DSPs, micro-controllers, application specific logic etc., whi...
Deepak Mathaikutty, Hiren D. Patel, Sandeep K. Shu...
ECML
1993
Springer
14 years 9 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman