Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Abstract. The full multigrid (FMG) algorithm is often claimed to achieve so-called discretizationlevel accuracy. In this paper, this notion is formalized by defining a worst-case r...
Carmen Rodrigo, Francisco J. Gaspar, Cornelis W. O...
Abstract—Triangulation serves as the basis for many geometrybased algorithms in wireless sensor networks. In this paper we propose a distributed algorithm that produces a triangu...
Hongyu Zhou, Hongyi Wu, Su Xia, Miao Jin, Ning Din...