We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing a...
Peyman Rezvani, Amir H. Ajami, Massoud Pedram, Ham...
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...