The military radio stations with frequency hopping propose new problems of frequency assignment which must take into account the size of the deployment, the limited resources and a...
Isabelle Devarenne, Alexandre Caminada, Hakim Mabe...
We consider a scenario where devices with multiple networking capabilities access networks with heterogeneous characteristics. In such a setting, we address the problem of effici...
Jatinder Pal Singh, Tansu Alpcan, Piyush Agrawal, ...
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...