Sciweavers

727 search results - page 89 / 146
» Private approximation of search problems
Sort
View
EPIA
1997
Springer
14 years 2 months ago
GenSAT: A Navigational Approach
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...
Yury V. Smirnov, Manuela M. Veloso
TROB
2011
255views more  TROB 2011»
13 years 4 months ago
Active 3D Object Localization Using a Humanoid Robot
—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...
Alexander Andreopoulos, Stephan Hasler, Heiko Wers...
ATAL
2009
Springer
14 years 4 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
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...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
PODS
2011
ACM
163views Database» more  PODS 2011»
13 years 24 days ago
Provenance views for module privacy
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...
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debm...
AUTOMATICA
2002
111views more  AUTOMATICA 2002»
13 years 9 months ago
Virtual reference feedback tuning: a direct method for the design of feedback controllers
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...
M. C. Campi, A. Lecchini, Sergio M. Savaresi