Sciweavers

9626 search results - page 217 / 1926
» Invariant Based Programming
Sort
View
JSAC
2006
79views more  JSAC 2006»
15 years 6 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
IJISTA
2007
119views more  IJISTA 2007»
15 years 6 months ago
Online modelling based on Genetic Programming
: Genetic Programming (GP), a heuristic optimisation technique based on the theory of Genetic Algorithms (GAs), is a method successfully used to identify non-linear model structure...
Stephan M. Winkler, Hajrudin Efendic, Luigi del Re...
JDCTA
2010
159views more  JDCTA 2010»
15 years 1 months ago
QSPR Study Of Mineral Crystal Lattice Energy Based On Gene Expression Programming
In this study, gene expression programming (GEP), a novel genetic algorithm, is used to develop quantitative model as potential screening mechanism for mineral crystal lattice ene...
Yuntao Zhang, Wenbin Dai, Zhengjun Cheng
SIAMJO
2010
110views more  SIAMJO 2010»
15 years 1 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers