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
Sentiment Analysis Of Public Comments On Licensing Services Seeks To Use The Naive Bayes Algorithm With Genetic Selection Algorithm
Articolo
Articolo
Abdulatif Patue et al · Islamic University of Indragiri · 2024 · ISSN 2302-8149
The Investment and One-Stop Integrated Service Office is the Licensing Service service to support an area in terms of business potential and investment value. Presenting MSME Business Actors and Young Entrepreneurs. As t...
LCC TENDOlRlY2hub2xvZ3k~; TENDOkluZm9ybWF0aW9uIHRlY2hub2xvZ3k~Idioma ind
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Source Quantitative Identification by Reference-Based Cubic Blind Deconvolution Algorithm
Articolo
Articolo
Xin Luo et al · KeAi Communications Co., Ltd · 2023 · ISSN 2192-8258
Abstract The semi-blind deconvolution algorithm improves the separation accuracy by introducing reference information. However, the separation performance depends largely on the construction of reference signals. To impr...
LCC LCC:Ocean engineering; TENDOk1lY2hhbmljYWwgZW5naW5lZXJpbmcgYW5kIG1hY2hpbmVyeQ~~Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
State Estimation of Drive-by-Wire Chassis Vehicle Based on Dual Unscented Particle Filter Algorithm
Articolo
Articolo
Zixu Wang et al · KeAi Communications Co., Ltd · 2024 · ISSN 2192-8258
Abstract Accurate vehicle dynamic information plays an important role in vehicle driving safety. However, due to the characteristics of high mobility and multiple controllable degrees of freedom of drive-by-wire chassis ...
LCC LCC:Ocean engineering; TENDOk1lY2hhbmljYWwgZW5naW5lZXJpbmcgYW5kIG1hY2hpbmVyeQ~~Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Target Vehicle Selection Algorithm for Adaptive Cruise Control Based on Lane-changing Intention of Preceding Vehicle
Articolo
Articolo
Jun Yao et al · KeAi Communications Co., Ltd · 2021 · ISSN 1000-9345
Abstract To improve the ride comfort and safety of a traditional adaptive cruise control (ACC) system when the preceding vehicle changes lanes, it proposes a target vehicle selection algorithm based on the prediction of ...
LCC LCC:Ocean engineering; TENDOk1lY2hhbmljYWwgZW5naW5lZXJpbmcgYW5kIG1hY2hpbmVyeQ~~Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
The Use of Original and Hybrid Flower Pollination Algorithm In Estimating The Parameters of Software Reliability Growth Models
Articolo
Articolo
Jamal Alneamy et al · University of Mosul, College of Education for Pure Science · 2019 · ISSN 1812-125X
In order to assess software reliability, many software reliability growth models (SRGMs) have been used for estimation of reliability growth. . In this work, the parameters of (SRGMs) were estimated by using Flower Polli...
LCC TENDOkVkdWNhdGlvbg~~; LCC:Science (General)Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Treatment management algorithm for natural frozen embryo transfer cycles using a real-time ovulation prediction machine learning model
Articolo
Articolo
Eden Moran et al · Nature Portfolio · 2026 · ISSN 2045-2322
Abstract Our aim was to develop an AI-based NC-FET Treatment Management Algorithm (NTMA), decision-support system that predicts ovulation in real time to manage and optimize natural frozen embryo transfer cycle (NC-FET) ...
LCC LCC:Medicine; TENDOlNjaWVuY2U~Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Using a Partition System to Improve the Performance of the Apriori Algorithm in Speeding Up Itemset Frequency Search Process
Articolo
Articolo
Moch Syahrir et al · Islamic University of Indragiri · 2024 · ISSN 2302-8149
The apriori algorithm uses minimum support and minimum confidence to determine appropriate itemset rules for decision making. The problem faced in this research is how to improve the performance of the a priori algorithm...
LCC TENDOlRlY2hub2xvZ3k~; TENDOkluZm9ybWF0aW9uIHRlY2hub2xvZ3k~Idioma ind
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
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 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 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
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
An evolutionary algorithm to track changes of optimum value locations in dynamic environments
Articolo
Articolo
Aragón, Victoria S. et al · SEDICI UNLP · 2004
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. The concept of dynamic environments in the context of this paper means that the fitness landscape changes during the run...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
Testo / risorsa
Testo / risorsa
San Pedro, María Eugenia de et al · SEDICI UNLP · 2001
The study of earliness and tardiness penalties in scheduling is a relatively recent area of research. In the past, traditionally the emphasis was put on regular measures that are nondecreasing in job completion times suc...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Hybrid evolutionary algorithms for the TSP
Testo / risorsa
Testo / risorsa
Minetti, Gabriela F. et al · SEDICI UNLP · 2001
Even if simply stated the travelling salesman problem (TSP) is one of the most studied NP-hard problems. Many algorithms have been proposed to solve TSP. Dynamic programming and branch and bound techniques provided the g...
Idioma Español
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Improving evolutionary algorithms performance by extending incest prevention
Testo / risorsa
Testo / risorsa
Alfonso, Hugo et al · SEDICI UNLP · 1998
Provision of population diversity is one of the main goals to avoid premature convergence in Evolutionary Algorithms (EAs). In this way the risk of being trapped in local optima is minimised. Eshelman and Shaffer [4] att...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
Testo / risorsa
Testo / risorsa
Salto, Carolina et al · SEDICI UNLP · 2001
Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improvements towards convergence issues in EAs include incest prevention and multiplicity features. A multiplicity feature all...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Multiple crossover per couple and fitness proportional couple selection in genetic algorithms
Testo / risorsa
Testo / risorsa
Esquivel, Susana Cecilia et al · SEDICI UNLP · 1997
Contrasting with conventional approaches to crossover, Multiple Crossover Per Couple (MCPC) is an alternative, recently proposed [1], approach under which more than one crossover operation for each mating pair is allowed...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
Testo / risorsa
Testo / risorsa
Vilanova, Gabriela et al · SEDICI UNLP · 2002
In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each operation requires a different machine, so n jobs have to be processed in the same sequence on m machines. The processing ti...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Parallel evolutionary algorithms in telecommunications: two case studies
Testo / risorsa
Testo / risorsa
Alba, Eladio et al · SEDICI UNLP · 2002
Sequential and parallel evolutionary algorithms (EAs) are developed and evaluated on two hard optimisation problems arising in the field of Telecommunications: designing error correcting codes, and finding optimal placem...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access
Parallel genetic algorithms: a feasible distributed : Implementation
Testo / risorsa
Testo / risorsa
Ochoa, Claudio et al · SEDICI UNLP · 1996
Parallel genetic algorithms, models and implementations, attempts to exploit the intrinsically parallel nature of genetic algorithms. By distributing the total population, these models ref1ects a bebaviour nearer to that...
Idioma Español
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