1671 search results - page 182 / 335 » On the Covering Steiner Problem |
214
click to vote
EOR
2007
15 years 6 months ago
2007
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
249
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
343
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
162
click to vote
ICCBR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. When learning by observing an expert, cases can be automatically generated in an inexpensive manner. However, since this is a passive method of learning the observer has ...
167
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...