Sciweavers

1028 search results - page 195 / 206
» Character sets of strings
Sort
View
GECCO
2003
Springer
14 years 22 days ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
HICSS
2002
IEEE
113views Biometrics» more  HICSS 2002»
14 years 14 days ago
Persona: A Contextualized and Personalized Web Search
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...
Francisco Tanudjaja, Lik Mu
FOCS
2000
IEEE
13 years 12 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
ECAL
1999
Springer
13 years 11 months ago
Evolution of Neural Controllers with Adaptive Synapses and Compact Genetic Encoding
Abstract. This paper is concerned with arti cial evolution of neurocontrollers with adaptive synapses for autonomous mobile robots. The method consists of encoding on the genotype ...
Dario Floreano, Joseba Urzelai
DEBS
2007
ACM
13 years 11 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...