5214 search results - page 352 / 1043 » The Online Specialization Problem |
179
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
197
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
169
click to vote
AIPS
2003
15 years 8 months ago
2003
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
160
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
197
click to vote
DAM
2006
15 years 6 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...