14386 search results - page 289 / 2878 » The Chinese Generals Problem |
191
click to vote
JMLR
2010
15 years 1 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
155
click to vote
AMR
2007
Springer
16 years 27 days ago
2007
Springer
This paper is a critical analysis of the use of ontology as an instrument to specify the semantics of a document. The paper argue that not only is a logic of the type used in ontol...
189
click to vote
SIAMDM
1998
15 years 6 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
202
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
262
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...