17 search results - page 3 / 4 » Generating Admissible Heuristics by Abstraction for Search i... |
NLP
2000
13 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
FSE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
CP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
DILS
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
ECP
1997
Springer
13 years 9 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...