Sciweavers

2950 search results - page 422 / 590
» Computing with Infinitely Many Processes
Sort
View
GLVLSI
2005
IEEE
124views VLSI» more  GLVLSI 2005»
15 years 12 months ago
SOFTENIT: a methodology for boosting the software content of system-on-chip designs
Embedded software is a preferred choice for implementing system functionality in modern System-on-Chip (SoC) designs, due to the high flexibility, and lower engineering costs pro...
Abhishek Mitra, Marcello Lajolo, Kanishka Lahiri
PRICAI
2004
Springer
15 years 11 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
HPDC
2000
IEEE
15 years 10 months ago
Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness
While the MPP is still the most common architecture in supercomputer centers today, a simpler and cheaper machine configuration is growing increasingly common. This alternative s...
Bianca Schroeder, Mor Harchol-Balter
GD
1998
Springer
15 years 10 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
FOCS
1995
IEEE
15 years 10 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos