Sciweavers

4797 search results - page 279 / 960
» The complexity of partition tasks
Sort
View
ISPD
2003
ACM
103views Hardware» more  ISPD 2003»
15 years 12 months ago
An integrated floorplanning with an efficient buffer planning algorithm
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
Yuchun Ma, Xianlong Hong, Sheqin Dong, Song Chen, ...
SI3D
1999
ACM
15 years 11 months ago
MMR: an interactive massive model rendering system using geometric and image-based acceleration
We present a system for rendering very complex 3D models at interactive rates. We select a subset of the model as preferred viewpoints and partition the space into virtual cells. ...
Daniel G. Aliaga, Jonathan D. Cohen, Andrew Wilson...
HPCA
1999
IEEE
15 years 11 months ago
The Synergy of Multithreading and Access/Execute Decoupling
This work presents and evaluates a novel processor microarchitecture which combines two paradigms: access/ execute decoupling and simultaneous multithreading. We investigate how b...
Joan-Manuel Parcerisa, Antonio González
HPCN
1998
Springer
15 years 10 months ago
A Barotropic Global Ocean Model and its Parallel Implementation on Unstructured Grids
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
Hakan Öksüzoglu, A. G. M. van Hees
ATAL
2006
Springer
15 years 10 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein