Sciweavers

599 search results - page 64 / 120
» The repeater tree construction problem
Sort
View
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 9 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
TON
2002
91views more  TON 2002»
15 years 4 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 4 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 8 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
FLAIRS
2000
15 years 5 months ago
Inferencing Bayesian Networks from Time Series Data Using Natural Selection
This paper describes a new framework for using natural selection to evolve Bayesian Networks for use in forecasting time series data. It extends current research by introducing a ...
Andrew J. Novobilski, Farhad Kamangar