Sciweavers

16504 search results - page 90 / 3301
» New Problems, New Solutions
Sort
View
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
15 years 10 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
NCA
2007
IEEE
16 years 18 days ago
GRIDTS: A New Approach for Fault-Tolerant Scheduling in Grid Computing
This paper proposes GRIDTS, a grid infrastructure in which the resources select the tasks they execute, on the contrary to traditional infrastructures where schedulers find resou...
Fábio Favarim, Joni da Silva Fraga, Lau Che...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
EOR
2006
139views more  EOR 2006»
15 years 6 months ago
A critical-shaking neighborhood search for the yard allocation problem
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...
Andrew Lim, Zhou Xu
ECOOP
2004
Springer
15 years 11 months ago
The Expression Problem Revisited
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
Mads Torgersen