Sciweavers

1332 search results - page 168 / 267
» Combinatorial Algorithms
Sort
View
AI
2003
Springer
14 years 2 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 1 months ago
Increasing Power Efficiency in Transmitter Diversity Systems under Error Performance Constraints
Motivated by combinatorial optimization theory, we propose an algorithmic power allocation method that minimizes the total transmitting power in transmitter diversity systems, prov...
Diomidis S. Michalopoulos, Athanasios S. Lioumpas,...
ICML
2010
IEEE
13 years 10 months ago
Learning Programs: A Hierarchical Bayesian Approach
We are interested in learning programs for multiple related tasks given only a few training examples per task. Since the program for a single task is underdetermined by its data, ...
Percy Liang, Michael I. Jordan, Dan Klein
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
Isolating the benefits of respect
The three mechanisms of crossover are transmission, assortment, and respect. Of these three mechanisms, assortment (i.e. recombination) is traditionally viewed as the primary feat...
Stephen Chen, Gregory Pitt
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 4 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...