Sciweavers

163 search results - page 12 / 33
» Evolution of Search Algorithms Using Graph Structured Progra...
Sort
View
UPP
2004
Springer
15 years 2 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
ECIR
2006
Springer
14 years 10 months ago
Clustering-Based Searching and Navigation in an Online News Source
The growing amount of online news posted on the WWW demands new algorithms that support topic detection, search, and navigation of news documents. This work presents an algorithm f...
Simón C. Smith, M. Andrea Rodríguez
HT
1993
ACM
15 years 1 months ago
Searching for the Missing Link: Discovering Implicit Structure in Spatial Hypertext
Hypertexts may be implicitly structured, based on either node content or context. In this paper, we examine implicit structures that rely on the interpretation of node’s spatial...
Catherine C. Marshall, Frank M. Shipman III
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 1 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
CORR
2006
Springer
100views Education» more  CORR 2006»
14 years 9 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu