Sciweavers

2652 search results - page 226 / 531
» Privacy-preserving linear programming
Sort
View
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 5 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
AAAI
2000
15 years 5 months ago
Structure, Duality, and Randomization: Common Themes in AI and OR
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...
Carla P. Gomes
FOCM
2007
94views more  FOCM 2007»
15 years 3 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
AMAI
2002
Springer
15 years 3 months ago
Generalizations of Watched Literals for Backtracking Search
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
Allen Van Gelder
MOR
2000
162views more  MOR 2000»
15 years 3 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan