Sciweavers

15485 search results - page 45 / 3097
» Computing Optimal Subsets
Sort
View
CCE
2004
13 years 7 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
PUC
2006
93views more  PUC 2006»
13 years 7 months ago
Comparing end-user and intelligent remote control interface generation
Traditional remote controls typically allow users to activate functionality of a single device. Given that users activate a subset of functionality across devices to accomplish a p...
Olufisayo Omojokun, Jeffrey S. Pierce, Charles Lee...
TCS
2008
13 years 7 months ago
Finding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
David Coeurjolly, Jérôme Hulin, Isabe...
CEC
2005
IEEE
14 years 1 months ago
Multiobjective financial portfolio design: a hybrid evolutionary approach
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
Raj Subbu, Piero P. Bonissone, Neil Eklund, Sriniv...