Sciweavers

13987 search results - page 587 / 2798
» The Two Guards Problem
Sort
View
CSCLP
2005
Springer
16 years 23 days ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
ECML
2005
Springer
16 years 23 days ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
16 years 23 days ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
ICALP
2005
Springer
16 years 23 days ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis
ICCS
2005
Springer
16 years 23 days ago
Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
Ion I. Mandoiu, Claudia Prajescu, Dragos Trinca