Novità Aiuto Accesso istituzionale

Cerca risorse accademiche

Esplora cataloghi istituzionali, risorse elettroniche, riviste ad accesso aperto, collezioni disponibili e collegamenti per l’accesso accademico.

Ricerca avanzata
Cosa riunisce NODOVOX Discovery: Cataloghi istituzionali, risorse elettroniche, riviste ad accesso aperto, collezioni disponibili e collegamenti per l’accesso accademico.
medicina legale diritto riviste Open Access testo completo

Risultati

3 risultati trovati.

Tipi di risorsa: Libro cartaceo Libro elettronico Articolo Rivista Tesi Capitolo
Ricerca accademica
Parallelizing algorithms in ada on clementina II : Face recognition system
Testo / risorsa
Testo / risorsa
Parallelizing algorithms in ada on clementina II : Face recognition system
Champredonde, Raúl et al · SEDICI UNLP · 2001
In the Laboratory of Research and Development on Computer Science of the National University of La Plata, a face recognition system has been developed. This article describes a series of testings based on parallel proces...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Ver opciones de acceso Record bibliografico
On bulk-synchronous distributed-memory parallel processing of relational-database transactions
Testo / risorsa
Testo / risorsa
On bulk-synchronous distributed-memory parallel processing of relational-database transactions
Marín, Mauricio et al · SEDICI UNLP · 2001
This paper describes two parallel algorithms for the eÆcient processing of relational database transactions and presents a performance analysis of them. These algorithms are built upon the bulk-synchronous parallel mode...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Ver opciones de acceso Record bibliografico
Evolutionary approaches for the parallel task scheduling problem : the representation issue
Testo / risorsa
Testo / risorsa
Evolutionary approaches for the parallel task scheduling problem : the representation issue
Esquivel, Susana Cecilia et al · SEDICI UNLP · 2001
The problem of how to find a schedule on m > 2 processors of equal capacity that minimises the whole processing time of independent tasks has been shown as belonging to the NP-complete class (Horowitz and Sahni [12]). Ev...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Ver opciones de acceso Record bibliografico
NODITO
Asistencia de búsqueda académica
Te ayudo a buscar, encontrar y acceder a recursos académicos.
Consultar con NODITO
¿Qué necesitás hacer?
Consultas rápidas
NODITO Asistencia contextual NDX