Sciweavers

11384 search results - page 345 / 2277
» Achieved IPC Performance
Sort
View
SC
2003
ACM
15 years 6 months ago
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
George Karypis
ASYNC
2002
IEEE
115views Hardware» more  ASYNC 2002»
15 years 5 months ago
Point to Point GALS Interconnect
Reliable, low-latency channel communication between independent clock domains may be achieved using a combination of clock pausing techniques, self-calibrating delay lines and an ...
George S. Taylor, Simon W. Moore, Robert D. Mullin...
94
Voted
AGENTS
2000
Springer
15 years 5 months ago
A comparison of coordinated planning methods for cooperating rovers
This paper describes and evaluates three methods for coordinating multiple agents. These agents interact in two ways. First, they are able to work together to achieve a common poo...
Steve A. Chien, Anthony Barrett, Tara A. Estlin, G...
103
Voted
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 5 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
MICRO
1998
IEEE
75views Hardware» more  MICRO 1998»
15 years 5 months ago
Improving Prediction for Procedure Returns with Return-address-stack Repair Mechanisms
This paper evaluates several mechanisms for repairing the return-address stack after branch mispredictions. The return-address stack is a small but important structure for achievi...
Kevin Skadron, Pritpal S. Ahuja, Margaret Martonos...