Sciweavers

4432 search results - page 432 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
ICCAD
1997
IEEE
75views Hardware» more  ICCAD 1997»
15 years 8 months ago
An exact gate decomposition algorithm for low-power technology mapping
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...
Hai Zhou, D. F. Wong
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
15 years 8 months ago
Mixing independent classifiers
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
Jan Drugowitsch, Alwyn Barry
EMO
2006
Springer
182views Optimization» more  EMO 2006»
15 years 8 months ago
Multi-objective Pole Placement with Evolutionary Algorithms
Multi-Objective Evolutionary Algorithms (MOEA) have been succesfully applied to solve control problems. However, many improvements are still to be accomplished. In this paper a new...
Gustavo Sánchez, Minaya Villasana, Miguel S...
136
Voted
AIPS
2006
15 years 5 months ago
Concurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
Iain Little, Sylvie Thiébaux
IANDC
2006
86views more  IANDC 2006»
15 years 4 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich