Sciweavers

9842 search results - page 1 / 1969
» Problem complexity
Sort
View
COMPLEXITY
2004
76views more  COMPLEXITY 2004»
13 years 4 months ago
The standing ovation problem
John H. Miller, Scott E. Page
DEDS
2006
78views more  DEDS 2006»
13 years 4 months ago
The Equivalence between Ordinal Optimization in Deterministic Complex Problems and in Stochastic Simulation Problems
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
Yu-Chi Ho, Qing-Shan Jia, Qianchuan Zhao
MST
2006
99views more  MST 2006»
13 years 4 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
ICECCS
1997
IEEE
102views Hardware» more  ICECCS 1997»
13 years 9 months ago
Problem complexity
An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because ...
Michael Jackson
FOGA
2011
12 years 8 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly