Sciweavers

5316 search results - page 112 / 1064
» Which Search Problems Are Random
Sort
View
CN
2000
92views more  CN 2000»
15 years 3 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
SIGIR
2004
ACM
15 years 8 months ago
Knowing Where to Search: Personalized Search Strategies for Peers in P2P Networks
Optimizing and focusing search and results ranking in P2P networks becomes more and more important with the increasing size of these networks. Even though a few approaches have al...
Paul-Alexandru Chirita, Wolfgang Nejdl, Oana Scurt...
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
15 years 8 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
IFIP
2004
Springer
15 years 8 months ago
Solving Geometrical Place Problems by using Evolutionary Algorithms
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
Crina Grosan
276
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...