Sciweavers

9119 search results - page 195 / 1824
» A Simultaneous Search Problem
Sort
View
IBERAMIA
2004
Springer
15 years 12 months ago
Constrainedness and Redundancy by Constraint Ordering
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Miguel A. Salido, Federico Barber
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 3 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
WINE
2007
Springer
124views Economy» more  WINE 2007»
16 years 18 days ago
Stochastic Models for Budget Optimization in Search-Based Advertising
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
S. Muthukrishnan, Martin Pál, Zoya Svitkina
EOR
2006
118views more  EOR 2006»
15 years 6 months ago
Multi-objective tabu search using a multinomial probability mass function
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Nor...
IJAIT
2002
81views more  IJAIT 2002»
15 years 6 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos