Sciweavers

14078 search results - page 419 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
SPAA
1990
ACM
15 years 11 months ago
Low Overhead Parallel Schedules for Task Graphs
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
Richard J. Anderson, Paul Beame, Walter L. Ruzzo
DAC
2005
ACM
15 years 8 months ago
A green function-based parasitic extraction method for inhomogeneous substrate layers
This paper presents a new Green function-based approach for substrate parasitic extraction in substrates with inhomogeneous layers. This new formulation allows analysis of noise c...
Chenggang Xu, Ranjit Gharpurey, Terri S. Fiez, Kar...
ICPP
2006
IEEE
16 years 26 days ago
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
Robert Niewiadomski, José Nelson Amaral, Ro...
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
HPDC
2009
IEEE
16 years 1 months ago
Resource co-allocation for large-scale distributed environments
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
Claris Castillo, George N. Rouskas, Khaled Harfous...