Výsledky vyhľadávania - Classificació AMS::68 Computer science::68W Algorithms

Stabbing segments with rectilinear objects Autor Claverol, Mercè, Garijo, Delia, Korman, Matias, Seara, Carlos, Silveira, Rodrigo I.

“… of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers…”
Získať plný text

Signcryption schemes with threshold unsigncryption, and applications Autor Herranz, Javier, Ruiz, Alexandre, Sáez, Germán

“…The goal of a signcryption scheme is to achieve the same functionalities as encryption and signature together, but in a more efficient way than encrypting and…”
Získať plný text

Minimal canonical comprehensive Gröbner systems Autor Manubens, Montserrat, Montes, Antonio

“… An algorithm to obtain a canonical description of the segments of the Minimal Canonical CGS is given, thus completing the whole MCCGS algorithm…”
Získať plný text

A new meta-module for efficient reconfiguration of hinged-units modular robots Autor Parada, Irene, Sacristan, Vera, Silveira, Rodrigo I.

“…, such as those designed for Crystalline and Telecube robots. These results make it possible to apply efficient geometric reconfiguration algorithms to this type of robots…”
Získať plný text

The partial line digraph technique in the design of large interconnection networks Autor Fiol, M.A., Llado, A.S.

“…The following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum…”
Získať plný text

Discrete Optimization Problem in Local Networks and Data Alignment Autor FIOL, M. A, YEBRA, J. L. A, ALEGRE, I, VALERO, M

“…This paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data…”
Získať plný text

Line digraph iterations and the (d,k) digraph problem Autor Fiol Mora, Miquel Àngel, Andrés Yebra, José Luis, Alegre de Miguel, Ignacio

“… In particular, this solves the (d, k) digraph problem for k = 2. Also, the line digraph technique provides us with a simple local routing algorithm for the corresponding…”
Získať plný text