Sciweavers

1237 search results - page 63 / 248
» Partitions and the Fermi-Dirac Distribution
Sort
View
SIGACT
2002
61views more  SIGACT 2002»
15 years 5 months ago
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all ...
Seth Gilbert, Nancy A. Lynch
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
16 years 18 days ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés
HPCA
2008
IEEE
16 years 6 months ago
Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, X...
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 11 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
COLT
2007
Springer
16 years 9 days ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum