Sciweavers

256 search results - page 12 / 52
» On a Generalized Notion of Mistake Bounds
Sort
View
IOR
2011
133views more  IOR 2011»
14 years 4 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
ERCIMDL
2005
Springer
83views Education» more  ERCIMDL 2005»
15 years 3 months ago
Automatic Detection of Survey Articles
We propose a method for detecting survey articles in a multilingual database. Generally, a survey article cites many important papers in a research domain. Using this feature, it i...
Hidetsugu Nanba, Manabu Okumura
COLT
2000
Springer
15 years 1 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
14 years 9 months ago
A Layered Analysis of Consensus
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
Yoram Moses, Sergio Rajsbaum
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 4 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard