Sciweavers

1047 search results - page 37 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
AMC
2008
88views more  AMC 2008»
13 years 7 months ago
Global convergence of a modified spectral FR conjugate gradient method
Abstract: The nonlinear conjugate gradient method is widely used in unconstrained optimization. However, the line search is very difficult or expensive sometimes. In this paper, we...
Shou-qiang Du, Yuan-yuan Chen
IBERAMIA
2004
Springer
14 years 1 months ago
A Multi-robot Strategy for Rapidly Searching a Polygonal Environment
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
AAAI
1996
13 years 9 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
CIBCB
2009
IEEE
13 years 8 months ago
rnaDesign: Local search for RNA secondary structure design
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
Denny C. Dai, Herbert H. Tsang, Kay C. Wiese
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 2 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak