3433 search results - page 487 / 687 » Heuristics for a bidding problem |
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
148
click to vote
JPDC
2006
15 years 6 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
196
click to vote
TCAD
2008
15 years 6 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
201
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
168
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...