Sciweavers

1299 search results - page 103 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
DEBS
2007
ACM
15 years 1 months ago
Adapting publish-subscribe routing to traffic demands
Most of currently available content-based publish-subscribe systems that were designed to operate in large scale, wired scenarios, build their routing infrastructure as a set of b...
Matteo Migliavacca, Gianpaolo Cugola
DAC
2004
ACM
15 years 3 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
ICDCS
1996
IEEE
15 years 2 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
AAAI
2010
14 years 11 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...