Sciweavers

3055 search results - page 141 / 611
» Randomized Search Trees
Sort
View
CP
2004
Springer
14 years 4 months ago
Statistical Regimes Across Constrainedness Regions
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
Carla P. Gomes, Cèsar Fernández, Bar...
ICML
2006
IEEE
14 years 11 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
14 years 5 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
Nikhil R. Devenur, Thomas P. Hayes
AAAI
2000
14 years 3 days ago
Structure, Duality, and Randomization: Common Themes in AI and OR
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...
Carla P. Gomes
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
14 years 2 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom