Sciweavers

CIKM
2010
Springer
13 years 5 months ago
On bootstrapping recommender systems
Recommender systems perform much better on users for which they have more information. This gives rise to a problem of satisfying users new to a system. The problem is even more a...
Nadav Golbandi, Yehuda Koren, Ronny Lempel
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 12 months ago
Parameter-less evolutionary search
The paper presents the parameter-less implementation of an evolutionary-based search. It does not need any predefined control parameters values, which are usually used for geneti...
Gregor Papa
HT
2009
ACM
14 years 2 months ago
Context-based ranking in folksonomies
With the advent of Web 2.0 tagging became a popular feature. People tag diverse kinds of content, e.g. products at Amazon, music at Last.fm, images at Flickr, etc. Clicking on a t...
Fabian Abel, Matteo Baldoni, Cristina Baroglio, Ni...
GECCO
2009
Springer
122views Optimization» more  GECCO 2009»
14 years 2 months ago
Visualising random boolean network dynamics
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
Susan Stepney
PODC
2010
ACM
14 years 2 months ago
Brief announcement: on the quest of optimal service ordering in decentralized queries
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
Efthymia Tsamoura, Anastasios Gounaris, Yannis Man...
JCDL
2003
ACM
119views Education» more  JCDL 2003»
14 years 4 months ago
Genescene: Biomedical Text And Data Mining
To access the content of digital texts efficiently, it is necessary to provide more sophisticated access than keyword based searching. Genescene provides biomedical researchers wi...
Gondy Leroy, Hsinchun Chen, Jesse D. Martinez, Sha...
IPSN
2004
Springer
14 years 4 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 4 months ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 5 months ago
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
A. E. Eiben, Marc Schoenauer, Juan Luís Jim...
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 5 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean