Sciweavers

216 search results - page 26 / 44
» Covering Problems with Hard Capacities
Sort
View
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
SIGMETRICS
2009
ACM
134views Hardware» more  SIGMETRICS 2009»
14 years 2 months ago
DRAM errors in the wild: a large-scale field study
Errors in dynamic random access memory (DRAM) are a common form of hardware failure in modern compute clusters. Failures are costly both in terms of hardware replacement costs and...
Bianca Schroeder, Eduardo Pinheiro, Wolf-Dietrich ...
CCS
2005
ACM
14 years 1 months ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
SSD
2007
Springer
133views Database» more  SSD 2007»
14 years 1 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...