Sciweavers

2182 search results - page 325 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
UAI
2008
15 years 3 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
DM
2006
128views more  DM 2006»
15 years 2 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
119
Voted
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 9 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
ECML
2007
Springer
15 years 8 months ago
Discriminative Sequence Labeling by Z-Score Optimization
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
Elisa Ricci, Tijl De Bie, Nello Cristianini
ITICSE
2010
ACM
15 years 4 months ago
What did qubits ever do for me: an answer for CS2 students
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
Michael Main, Robert Frohardt, Yingdan Huang