Sciweavers

3134 search results - page 355 / 627
» Computing full disjunctions
Sort
View
91
Voted
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 5 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
101
Voted
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
15 years 5 months ago
The Kalman like particle filter: Optimal estimation with quantized innovations/measurements
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...
Ravi Teja Sukhavasi, Babak Hassibi
IWOMP
2009
Springer
15 years 5 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
CIKM
2001
Springer
15 years 5 months ago
Index Filtering and View Materialization in ROLAP Environment
Using materialized view to accelerate OLAP queries is one of the most common methods used in ROLAP systems. However, high storage and computation cost make this method very diffic...
Shi Guang Qiu, Tok Wang Ling
104
Voted
FM
2001
Springer
130views Formal Methods» more  FM 2001»
15 years 5 months ago
Towards a Topos Theoretic Foundation for the Irish School of Constructive Mathematics
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
Mícheál Mac an Airchinnigh