Sciweavers

129 search results - page 7 / 26
» Optimal solutions for moving target search
Sort
View
ICAC
2007
IEEE
14 years 1 months ago
Strider Search Ranger: Towards an Autonomic Anti-Spam Search Engine
Search spammers use questionable search engine optimization techniques to promote their spam links into top search results. Large-scale spammers target commerce queries that they ...
Yi-Min Wang, Ming Ma
ICCV
2009
IEEE
15 years 29 days ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
IAT
2010
IEEE
13 years 7 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
AIPS
2006
13 years 11 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
CEC
2010
IEEE
13 years 10 months ago
Population-Based Guided Local Search: Some preliminary experimental results
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (PGLS) framework for dealing with difficult combinatorial optimization problem...
Nasser Tairan, Qingfu Zhang