14518 search results - page 326 / 2904 » Two Problems for Sophistication |
140
Voted
CPM
2004
Springer
16 years 3 days ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
190
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
178
click to vote
PDCN
2004
15 years 8 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
176
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
169
click to vote
MOR
2008
15 years 6 months ago
2008
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...