Sciweavers

2089 search results - page 54 / 418
» A New Problem in String Searching
Sort
View
HEURISTICS
2002
122views more  HEURISTICS 2002»
14 years 9 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
ERCIMDL
1998
Springer
132views Education» more  ERCIMDL 1998»
15 years 1 months ago
An Analysis of Usage of a Digital Library
As experimental digital library testbeds gain wider acceptance and develop significant user bases, it becomes important to investigate the ways in which users interact with the sys...
Steve Jones, Sally Jo Cunningham, Rodger J. McNab
APWEB
2006
Springer
15 years 1 months ago
A New Methodology for Information Presentations on the Web
Abstract. The rapid growth of on-line information including multimedia contents during the last decade caused a major problem for Web users - there is too much information availabl...
Hyun Woong Shin, Dennis McLeod, Larry Pryor
IWANN
2009
Springer
15 years 4 months ago
A Genetic Algorithm for ANN Design, Training and Simplification
This paper proposes a new evolutionary method for generating ANNs. In this method, a simple real-number string is used to codify both architecture and weights of the networks. Ther...
Daniel Rivero, Julian Dorado, Enrique Ferná...
GECCO
2004
Springer
107views Optimization» more  GECCO 2004»
15 years 3 months ago
An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
Jonathan E. Rowe, Dzena Hidovic