1322 search results - page 85 / 265 » Parameterized counting problems |
AIPS
2006
13 years 10 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
SEAL
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. In this paper, we discuss an approach to an operator scheduling problem in a large organization over time with the aim of maintaining service quality and reducing total l...
ACL
2004
13 years 10 months ago
2004
Discriminative methods have shown significant improvements over traditional generative methods in many machine learning applications, but there has been difficulty in extending th...
IPSN
2007
Springer
14 years 3 months ago
2007
Springer
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...