5316 search results - page 325 / 1064 » Which Search Problems Are Random |
191
click to vote
AIPS
2010
15 years 7 months ago
2010
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
176
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
155
click to vote
GCC
2004
Springer
16 years 13 days ago
2004
Springer
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
206
click to vote
AICCSA
2007
IEEE
16 years 1 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
190
click to vote
JCDL
2005
ACM
16 years 18 days ago
2005
ACM
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...