Sciweavers

94 search results - page 8 / 19
» Investigating a hybrid simulated annealing and local search ...
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
CVPR
2008
IEEE
14 years 9 months ago
Object tracking and detection after occlusion via numerical hybrid local and global mode-seeking
Given an object model and a black-box measure of similarity between the model and candidate targets, we consider visual object tracking as a numerical optimization problem. During...
Zhaozheng Yin, Robert T. Collins
ICWS
2009
IEEE
13 years 5 months ago
Discovery of Optimized Web Service Configurations Using a Hybrid Semantic and Statistical Approach
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
Maciej Zaremba, Jacek Migdal, Manfred Hauswirth
LION
2009
Springer
145views Optimization» more  LION 2009»
14 years 2 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
ECAI
2006
Springer
13 years 11 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen