Sciweavers

10493 search results - page 228 / 2099
» Dynamic Word Problems
Sort
View
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 8 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 2 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
GECCO
2005
Springer
14 years 1 months ago
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
Jason M. Daida, Michael E. Samples, Matthew J. Byo...
GECCO
2000
Springer
109views Optimization» more  GECCO 2000»
13 years 12 months ago
GP+Echo+Subsumption = Improved Problem Solving
Real-time, adaptive control is a difficult problem that can be addressed by EC architectures. We are interested in incorporating into an EC architecture some of the features that ...
William F. Punch, W. M. Rand
EOR
2007
80views more  EOR 2007»
13 years 8 months ago
Coherent risk measures in inventory problems
We analyze an extension of the classical multi-period, single-item, linear cost inventory problem where the objective function is a coherent risk measure. Properties of coherent r...
Shabbir Ahmed, Ulas Çakmak, Alexander Shapi...