4428 search results - page 99 / 886 » The Chow Parameters Problem |
141
Voted
GECCO
1999
Springer
15 years 7 months ago
1999
Springer
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
113
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
115
Voted
AAAI
2007
15 years 5 months ago
2007
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
119
Voted
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
111
click to vote
WSC
2004
15 years 4 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...