Sciweavers

1639 search results - page 309 / 328
» Anytime Heuristic Search
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 3 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
14 years 3 months ago
Neural network ensembles for time series forecasting
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
Victor M. Landassuri-Moreno, John A. Bullinaria
RECSYS
2009
ACM
14 years 3 months ago
Learning to recommend with trust and distrust relationships
With the exponential growth of Web contents, Recommender System has become indispensable for discovering new information that might interest Web users. Despite their success in th...
Hao Ma, Michael R. Lyu, Irwin King
IPPS
2008
IEEE
14 years 3 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri