Sciweavers

2976 search results - page 99 / 596
» On the bounded integer programming
Sort
View
ATAL
2008
Springer
15 years 2 months ago
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
Andrea Giovannucci, Meritxell Vinyals, Juan A. Rod...
UAI
2008
15 years 2 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel
118
Voted
CORR
2012
Springer
185views Education» more  CORR 2012»
13 years 8 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
SIAMJO
2010
121views more  SIAMJO 2010»
14 years 11 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...
COLT
1995
Springer
15 years 4 months ago
On Learning Bounded-Width Branching Programs
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld