Sciweavers

1477 search results - page 136 / 296
» Complexity of (iterated) dominance
Sort
View
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
15 years 8 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
ASPLOS
2008
ACM
15 years 8 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
CASCON
2008
124views Education» more  CASCON 2008»
15 years 8 months ago
Synchronized tag clouds for exploring semi-structured clinical trial data
Searching and comparing information from semi-structured repositories is an important, but cognitively complex activity for internet users. The typical web interface displays a li...
Maria-Elena Hernandez, Sean M. Falconer, Margaret-...
CORR
2007
Springer
144views Education» more  CORR 2007»
15 years 6 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
VLSID
2006
IEEE
150views VLSI» more  VLSID 2006»
16 years 6 months ago
A Comprehensive SoC Design Methodology for Nanometer Design Challenges
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
R. Raghavendra Kumar, Ricky Bedi, Ramadas Rajagopa...