4894 search results - page 610 / 979 » The Guarding Problem - Complexity and Approximation |
150
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
155
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
166
click to vote
PVLDB
2011
14 years 11 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...
144
click to vote
JMLR
2010
14 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
181
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...