1157 search results - page 71 / 232 » Solving iterated functions using genetic programming |
141
click to vote
ICN
2007
Springer
15 years 9 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
107
Voted
PLILP
1993
Springer
15 years 7 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
142
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
122
Voted
FOCM
2010
15 years 2 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
124
Voted
ISCI
2007
15 years 3 months ago
2007
The social foraging behavior of Escherichia coli bacteria has been used to solve optimization problems. This paper proposes a hybrid approach involving genetic algorithms (GA) and...