Sciweavers

380 search results - page 70 / 76
» Cluster Graphs as Abstractions for Constraint Satisfaction P...
Sort
View
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 1 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
CSCWD
2008
Springer
13 years 10 months ago
Task partition for function tree according to innovative functional reasoning
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
Yiming Tang, Xiaoping Liu
DCOSS
2007
Springer
14 years 2 months ago
Distributed Coalition Formation in Visual Sensor Networks: A Virtual Vision Approach
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
Faisal Qureshi, Demetri Terzopoulos
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 6 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
INFOCOM
2008
IEEE
14 years 3 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...