Sciweavers

3229 search results - page 382 / 646
» Mixing
Sort
View
ENDM
2010
115views more  ENDM 2010»
15 years 4 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi
206
Voted
AAMAS
2011
Springer
15 years 1 months ago
Benchmarking hybrid algorithms for distributed constraint optimisation games
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
Archie C. Chapman, Alex Rogers, Nicholas R. Jennin...
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
15 years 1 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
A Secure Communication Game with a Relay Helping the Eavesdropper
—In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source trans...
Melda Yuksel, Xi Liu, Elza Erkip
172
Voted
COLING
2010
15 years 1 months ago
Learning to Predict Readability using Diverse Linguistic Features
In this paper we consider the problem of building a system to predict readability of natural-language documents. Our system is trained using diverse features based on syntax and l...
Rohit J. Kate, Xiaoqiang Luo, Siddharth Patwardhan...