8647 search results - page 158 / 1730 » The Container Selection Problem |
112
click to vote
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
101
click to vote
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
102
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
136
click to vote
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
125
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...