Sciweavers

6976 search results - page 297 / 1396
» The Oil Searching Problem
Sort
View
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
16 years 3 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
CIKM
2009
Springer
16 years 1 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
ICCS
2009
Springer
16 years 1 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
219
Voted
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
16 years 1 days ago
Semantic representation: search and mining of multimedia content
Semantic understanding of multimedia content is critical in enabling effective access to all forms of digital media data. By making large media repositories searchable, semantic ...
Apostol Natsev, Milind R. Naphade, John R. Smith
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
16 years 1 days ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel