In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
Abstract— This paper investigates the implementation of highradix multiplication based on the Electron Counting (EC) paradigm in Single Electron Tunneling (SET) technology. First...
After a long history of compilation of our own lexical resources, EDR Japanese/English Electronic Dictionary, and discussions with major players on development of various WordNets...
Hitoshi Isahara, Francis Bond, Kiyotaka Uchimoto, ...
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....