Sciweavers

9716 search results - page 1887 / 1944
» The Case for Energy-Proportional Computing
Sort
View
ASPLOS
2008
ACM
15 years 8 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
ATAL
2008
Springer
15 years 8 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
ATAL
2008
Springer
15 years 8 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
CCS
2008
ACM
15 years 8 months ago
Securing group key exchange against strong corruptions
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
Emmanuel Bresson, Mark Manulis
« Prev « First page 1887 / 1944 Last » Next »