5595 search results - page 173 / 1119 » Comparing Subsumption Optimizations |
118
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
159
click to vote
TIP
2008
15 years 5 months ago
2008
The number of slices for error resilient video coding is jointly optimized with 802.11a-like media access control and the physical layers with automatic repeat request and rate com...
174
Voted
GPEM
2002
15 years 4 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
172
click to vote
NECO
1998
15 years 4 months ago
1998
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...
150
Voted
TIP
1998
15 years 4 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...