Sciweavers

3134 search results - page 231 / 627
» Computing full disjunctions
Sort
View
149
Voted
ECAI
2010
Springer
15 years 3 months ago
Optimal Task Migration in Service-Oriented Systems: Algorithms and Mechanisms
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
Sebastian Stein, Enrico Gerding, Nicholas R. Jenni...
141
Voted
MOBISYS
2010
ACM
15 years 5 months ago
MAUI: making smartphones last longer with code offload
This paper presents MAUI, a system that enables fine-grained energy-aware offload of mobile code to the infrastructure. Previous approaches to these problems either relied heavily...
Eduardo Cuervo, Aruna Balasubramanian, Dae-ki Cho,...
128
Voted
TOG
2008
174views more  TOG 2008»
15 years 3 months ago
A mass spring model for hair simulation
Our goal is to simulate the full hair geometry, consisting of approximately one hundred thousand hairs on a typical human head. This will require scalable methods that can simulat...
Andrew Selle, Michael Lentine, Ronald Fedkiw
ANCS
2010
ACM
15 years 1 months ago
Axon: a flexible substrate for source-routed ethernet
This paper introduces the Axon, an Ethernet-compatible device for creating large-scale datacenter networks. Axons are inexpensive, practical devices that are demonstrated using pr...
Jeffrey Shafer, Brent Stephens, Michael Foss, Scot...
DAM
2011
14 years 10 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire