1142 search results - page 64 / 229 » Set Variables and Local Search |
ALMOB
2006
13 years 10 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
INFORMS
2000
13 years 10 months ago
2000
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
IBERAMIA
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we tackle the problem of providing a mobile robot with the ability to build a map of its environment using data gathered during navigation. The data correspond to the...
CP
1995
Springer
14 years 1 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...