Sciweavers

438 search results - page 69 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 8 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
INFOCOM
2008
IEEE
15 years 9 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...
116
Voted
ICSE
2008
IEEE-ACM
16 years 4 months ago
Temporal dependency based checkpoint selection for dynamic verification of fixed-time constraints in grid workflow systems
In grid workflow systems, temporal correctness is critical to assure the timely completion of grid workflow execution. To monitor and control the temporal correctness, fixed-time ...
Jinjun Chen, Yun Yang
147
Voted
SIGIR
2004
ACM
15 years 8 months ago
Learning to cluster web search results
Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't g...
Hua-Jun Zeng, Qi-Cai He, Zheng Chen, Wei-Ying Ma, ...
128
Voted
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 6 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...