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 ...
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
"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 ...
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 ...
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...
Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilke...