Sciweavers

2680 search results - page 374 / 536
» The topology of the independence complex
Sort
View
IPPS
2005
IEEE
16 years 2 days ago
A Dependency Chain Clustered Microarchitecture
In this paper we explore a new clustering approach for reducing the complexity of wide issue in-order processors based on EPIC architectures. Complexity effectiveness is achieved ...
Satish Narayanasamy, Hong Wang 0003, Perry H. Wang...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
16 years 1 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
ICRA
2003
IEEE
165views Robotics» more  ICRA 2003»
15 years 11 months ago
Multi-robot task-allocation through vacancy chains
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
Torbjørn S. Dahl, Maja J. Mataric, Gaurav S...
SIGGRAPH
1996
ACM
15 years 10 months ago
Interactive Multiresolution Surface Viewing
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
Andrew Certain, Jovan Popovic, Tony DeRose, Tom Du...
CCS
2006
ACM
15 years 10 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang