Sciweavers

285 search results - page 52 / 57
» The complexity of soft constraint satisfaction
Sort
View
CCGRID
2008
IEEE
14 years 11 months ago
Fault Tolerance and Recovery of Scientific Workflows on Computational Grids
In this paper, we describe the design and implementation of two mechanisms for fault-tolerance and recovery for complex scientific workflows on computational grids. We present our ...
Gopi Kandaswamy, Anirban Mandal, Daniel A. Reed
MOBIHOC
2010
ACM
14 years 9 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 days ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
15 years 8 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
AMEC
2004
Springer
15 years 5 months ago
iAuctionMaker: A Decision Support Tool for Mixed Bundling
This paper presents iAuctionMaker as a novel tool that serves as a decision support for e-sourcing professionals on their pursuing of auction optimisation. Given a set of items to ...
Antonio Reyes-Moro, Juan A. Rodríguez-Aguil...