1887 search results - page 342 / 378 » An efficient search algorithm for partially ordered sets |
KBSE
1995
IEEE
13 years 11 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
BMCBI
2006
13 years 7 months ago
2006
Background: The identification of patterns in biological sequences is a key challenge in genome analysis and in proteomics. Frequently such patterns are complex and highly variabl...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
RECSYS
2009
ACM
14 years 2 months ago
2009
ACM
Short search engine queries do not provide contextual information, making it difficult for traditional search engines to understand what users are really requesting. One approach ...
AIPS
2008
13 years 10 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...