Sciweavers

2128 search results - page 423 / 426
» A general characterization of indulgence
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
ISCA
2010
IEEE
216views Hardware» more  ISCA 2010»
13 years 8 months ago
The impact of management operations on the virtualized datacenter
Virtualization has the potential to dramatically reduce the total cost of ownership of datacenters and increase the flexibility of deployments for general-purpose workloads. If pr...
Vijayaraghavan Soundararajan, Jennifer M. Anderson
SIAMAM
2010
69views more  SIAMAM 2010»
13 years 8 months ago
Single Phytoplankton Species Growth with Light and Advection in a Water Column
We investigate a nonlocal reaction-diffusion-advection equation which models the growth of a single phytoplankton species in a water column where the species depends solely on lig...
Sze-Bi Hsu, Yuan Lou
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 8 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
TCS
2010
13 years 8 months ago
Invariant games
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
Éric Duchêne, Michel Rigo