Sciweavers

5331 search results - page 239 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
WSC
2007
15 years 9 months ago
Allocation of simulation runs for simulation optimization
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
Alireza Kabirian, Sigurdur Ólafsson
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
15 years 6 months ago
Optimized on Demand Routing Protocol of Mobile Ad Hoc Network
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
Chinnappan Jayakumar, Chenniappan Chellappan
ASPDAC
2005
ACM
89views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Optimal placement by branch-and-price
— Circuit placement has a large impact on all aspects of performance; speed, power consumption, reliability, and cost are all affected by the physical locations of interconnected...
Pradeep Ramachandaran, Ameya R. Agnihotri, Satoshi...
JCP
2007
143views more  JCP 2007»
15 years 6 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 1 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold