727 search results - page 89 / 146 » Private approximation of search problems |
123
click to vote
EPIA
1997
Springer
15 years 7 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
148
click to vote
TROB
2011
14 years 10 months ago
2011
—We study the problem of actively searching for an object in a 3D environment under the constraint of a maximum search time, using a visually guided humanoid robot with twentysix...
134
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
135
click to vote
PODS
2011
ACM
14 years 6 months ago
2011
ACM
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...
122
Voted
AUTOMATICA
2002
15 years 3 months ago
2002
This paper considers the problem of designing a controller for an unknown plant based on input/output measurements. The new design method we propose is direct (no model identificat...