Cerca risorse accademiche

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

Cosa riunisce NODOVOX Discovery: Cataloghi istituzionali, risorse elettroniche, riviste ad accesso aperto, collezioni disponibili e collegamenti per l’accesso accademico.

Risultati

La ricerca ha raggiunto il limite operativo; vengono mostrati i risultati più pertinenti.

Tipi di risorsa: Libro cartaceo Libro elettronico Articolo Rivista Tesi Capitolo
Ricerca accademica
Algorithms design
Libro elettronico
Libro elettronico
Chaves Torres, Anivar · Sello Editorial UNAD · 2024 · ISBN 9786287786141
Materie / parole chiave: Ordenadores; Programación; Algoritmos
Idioma Inglés
Acceso institucional disponibleEl acceso puede requerir institución, suscripción, proxy, VPN o autenticación.
Institucional
Data protection for the prevention of algorithmic discrimination: Protecting from discrimination and other harms caused by algorithms through privacy in the EU and US: possibilities, shortcomings and proposals
Libro elettronico
Libro elettronico
Soriano Arnanz, Alba · LA LEY Soluciones Legales S.A · 2021 · ISBN 9788413900148
The development of digital technologies, capable of analysing massive amounts of data, has led to the widespread implementation of data processing technologies and automated decision-making processes in many areas of hum...
DDC 342.0858CDU 342.738(4-672 UE); 316.647.82(4-672 UE); 004.421LCC K3264.C65Idioma Inglés
Acceso institucional disponibleEl acceso puede requerir institución, suscripción, proxy, VPN o autenticación.
Institucional
Disinformation and polarization in the algorithmic society
Libro elettronico
Libro elettronico
Di Fátima, Branco · Editorial Universidad Icesi · 2024 · ISBN 9789899229075
This is the first book of the Online Hate Speech Trilogy. It focuses on the relationship between disinformation, political polarisation, and virtual attacks involving toxic language. These phenomena are much more complex...
Idioma Inglés
Acceso institucional disponibleEl acceso puede requerir institución, suscripción, proxy, VPN o autenticación.
Institucional
Solving Competitive Location Problems via Memetic Algorithms: High Performance Computing Approaches
Libro elettronico
Libro elettronico
Martínez Ortigosa, Pilar; Fernández Hernández, José; López Redondo, Juana · Editorial Universidad de Almería · 2008 · ISBN 9788482409146
La localización de servicios (“Facility location” en inglés) pretende encontrar el emplazamiento de uno o más centros (servicios) de modo que se optimice una determinada función objetivo. Dicha función objetivo pu...
Idioma Inglés
El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Material complementario
Genetic algorithm for textual criticism :
Libro
Libro
Chauta Velandia, Andrés Felipe · Editorial Universidad ECCI · 2026 · ISBN 9789588817927
Materie / parole chiave: Text processing (Computer science); Genetic algorithms; Computational linguistics
Acceso institucional disponibleEl acceso puede requerir institución, suscripción, proxy, VPN o autenticación.
Institucional
GEOGRAPHIC MEDICINE FOR THE PRACTITIONER : ALGORITHMS IN THE DIAGNOSIS AND MANAGEMENT OF EXOTIC DISEASES
Libro
Libro
THEUNIVERSIY OF CHICAGO PRESS · 1978 · ISBN 0-226-87386-2
Materie / parole chiave: THEUNIVERSIY OF CHICAGO PRESS; 616.988 G345g
A comparison between centralized and decentralized genetic algorithms for the identical parallel machines scheduling
Testo / risorsa
Testo / risorsa
Esquivel, Susana Cecilia · SEDICI UNLP · 2006
Identical parallel machines problems (Pm) involve task assignments to the system's resources (a machine bank in parallel). The basic model consists of m machines and n tasks. The tasks are assigned according to the avail...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A job allocation algorithm for parallel processors
Testo / risorsa
Testo / risorsa
Vakhania, Nodari · SEDICI UNLP · 1997
We are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the tot...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A new strategy for adapting the mutation probability in genetic algorithms
Testo / risorsa
Testo / risorsa
Stark, Natalia et al · SEDICI UNLP · 2012
Traditionally in Genetic Algorithms, the mutation probability parameter maintains a constant value during the search. However, an important difficulty is to determine a priori which probability value is the best suited f...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A parallel evolutionary algorithm applied to the minimum interference frequency assignment problem
Testo / risorsa
Testo / risorsa
Mora, Gerardo et al · SEDICI UNLP · 2006
This article presents the application of a Parallel Evolutionary Algorithm to solve the Minimum Interference Frequency Assignment Problem (MI-FAP). This is a capital problem in the mobile telecommunication field, which p...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A randomized algorithm for solving the satisfiability problem
Testo / risorsa
Testo / risorsa
Cecchi, Laura · SEDICI UNLP · 1997
In spite of the NP-completeness of the satisfiability decision problem (SAT problem), many researchers have been attracted by it because SAT has many applications in Artificial Intelligence. This paper presents a randomi...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A runnable functional formal memetic algorithm framework
Testo / risorsa
Testo / risorsa
Krasnogor, Natalio et al · SEDICI UNLP · 1998
Historically Functional Programming FP for short has been associated with a small scope of applications mainly academic The computer science community did not pay enough attention to its potential perhaps due t...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
Testo / risorsa
Testo / risorsa
Stark, Natalia et al · SEDICI UNLP · 2011
There are many different forms of recombination operators available in literature. However, it is difficult to determine a priori which one is the best suited for a given problem. This issue encourages us to propose an a...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A sliding window based management traffic clustering algorithm for 802.11 WLAN intrusion detection
Testo / risorsa
Testo / risorsa
Zhou, Wenzhe et al · SEDICI UNLP · 2006
This paper introduces a novel Management Traffic Clustering Algorithm (MTCA) based on a sliding window methodology for intrusion detection in 802.11 networks Active attacks and other network events such as scanning, join...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
Testo / risorsa
Testo / risorsa
Minetti, Gabriela F. et al · SEDICI UNLP · 2002
In this preliminary study the Flow Shop Scheduling Problem (FSSP) is solved by hybrid Evolutionary Algorithms. The algorithms are obtained as a combination of an evolutionary algorithm, which uses the Multi-Inver-Over op...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Adaptability of multirecombinated evolutionary algorithms to changing common due dates
Testo / risorsa
Testo / risorsa
Pandolfi, Daniel et al · SEDICI UNLP · 2001
In the restricted single-machine common due date problem, the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties. This problem, even in its simplest formulatio...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
Testo / risorsa
Testo / risorsa
San Pedro, María Eugenia de et al · SEDICI UNLP · 2002
In a production system it is usual to stress minimum tardiness to achieve higher client satisfaction. According to the client relevance, job processing costs and requirements, and various other considerations, a weight ...
Idioma Español
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Aggregation algorithms for regression : A comparison with boosting and SVM techniques
Testo / risorsa
Testo / risorsa
Granitto, Pablo Miguel et al · SEDICI UNLP · 2003
Classi cation and regression ensembles sho w generalization capabilities that outperform those of single predictors. We present here a further ev aluation of tw o algorithms for ensemble construction recently proposed by...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
An algorithm to deal with due date violation in a multi-objective scheduling problem
Testo / risorsa
Testo / risorsa
Ibáñez, Francisco S. et al · SEDICI UNLP · 2003
This paper includes part of the strategies used to solve a scheduling problem developed for a company that produces flexible packaging, presented in quite a general form though. In this problem it is necessary to schedul...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Pubblicazione seriale

3D cross-hole resistivity inversion imaging of surrounding rock based on distance weighting constraint algorithm

ISSN: 10004548 · Editore / fonte: Editorial Office of Chinese Journal of Geotechnical Engineering

241

contenuti disponibili

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