Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...