Sciweavers

613 search results - page 86 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
INFOVIS
2003
IEEE
14 years 2 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers
EOR
2010
149views more  EOR 2010»
13 years 8 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
IAT
2009
IEEE
14 years 18 days ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
13 years 9 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
14 years 3 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...