Sciweavers

906 search results - page 162 / 182
» Linking Theories of Concurrency
Sort
View
FOCS
2009
IEEE
16 years 25 days ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
AUTOMOTIVEUI
2009
ACM
16 years 18 days ago
Enhanced auditory menu cues improve dual task performance and are preferred with in-vehicle technologies
Auditory display research for driving has mainly focused on collision warning signals, and recent studies on auditory invehicle information presentation have examined only a limit...
Myounghoon Jeon, Benjamin K. Davison, Michael A. N...
MICRO
2007
IEEE
137views Hardware» more  MICRO 2007»
16 years 10 days ago
Implementing Signatures for Transactional Memory
Transactional Memory (TM) systems must track the read and write sets—items read and written during a transaction—to detect conflicts among concurrent transactions. Several TM...
Daniel Sanchez, Luke Yen, Mark D. Hill, Karthikeya...
CMSB
2007
Springer
16 years 7 days ago
Expressive Models for Synaptic Plasticity
We explore some presynaptic mechanisms of the calyx of Held synapse through a stochastic model. The model, drawn from a kinetic approach developed in literature, exploits process c...
Andrea Bracciali, Marcello Brunelli, Enrico Catald...
PODC
2005
ACM
15 years 11 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking