Sciweavers

14158 search results - page 331 / 2832
» Generalized switch-setting problems
Sort
View
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 10 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
149
Voted
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 10 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ISAAC
2005
Springer
76views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Improved Algorithms for the k Maximum-Sums Problems
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...
SAC
2003
ACM
15 years 9 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
FUN
2010
Springer
269views Algorithms» more  FUN 2010»
15 years 9 months ago
The Feline Josephus Problem
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
Frank Ruskey, Aaron Williams