3433 search results - page 118 / 687 » Heuristics for a bidding problem |
188
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
157
click to vote
ICTAI
2006
IEEE
16 years 14 days ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
200
click to vote
EOR
2007
15 years 6 months ago
2007
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
170
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
171
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...