Sciweavers

156 search results - page 26 / 32
» What are Cycle-Stealing Systems Good For
Sort
View
EMSOFT
2001
Springer
13 years 12 months ago
Interface Theories for Component-Based Design
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
Luca de Alfaro, Thomas A. Henzinger
ISCA
1998
IEEE
145views Hardware» more  ISCA 1998»
13 years 11 months ago
Multi-Level Texture Caching for 3D Graphics Hardware
Traditional graphics hardware architectures implement what we call the push architecture for texture mapping. Local memory is dedicated to the accelerator for fast local retrieval...
Michael Cox, Narendra Bhandri, Michael Shantz
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
14 years 1 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
SPAA
2004
ACM
14 years 24 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ATAL
2008
Springer
13 years 9 months ago
Aligning social welfare and agent preferences to alleviate traffic congestion
Multiagent coordination algorithms provide unique insights into the challenging problem of alleviating traffic congestion. What is particularly interesting in this class of proble...
Kagan Tumer, Zachary T. Welch, Adrian K. Agogino