Sciweavers

2107 search results - page 119 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
205
Voted
AIPS
2011
14 years 7 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
139
Voted
ICANN
2001
Springer
15 years 8 months ago
A Computational Intelligence Approach to Optimization with Unknown Objective Functions
In many practical engineering design problems, the form of objective function is not given explicitly in terms of design variables. Given the value of design variables, under this ...
Hirotaka Nakayama, Masao Arakawa, Rie Sasaki
152
Voted
BMCBI
2010
183views more  BMCBI 2010»
15 years 3 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
132
Voted
AAAI
2008
15 years 5 months ago
Manifold Integration with Markov Random Walks
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...
Heeyoul Choi, Seungjin Choi, Yoonsuck Choe
114
Voted
JCC
2007
110views more  JCC 2007»
15 years 3 months ago
Improved grid-based algorithm for Bader charge allocation
: An improvement to the grid-based algorithm of Henkelman et al. for the calculation of Bader volumes is suggested, which more accurately calculates atomic properties as predicted ...
Edward Sanville, Steven D. Kenny, Roger Smith, Gra...