Search results for "A* search algorithm"

showing 6 items of 16 documents

Orbit determination and errors of a star catalogue

1995

Abstract We obtain Ceres orbit taking into account all perturbations and applying correction of phase effect to observations. More than 3000 observations have been used and the results agree with other determinations. We have also investigated the influence of systematic errors of a star catalogue on the observations and its effect on final elements. To that aim, a simulation procedure has been applied to Ceres observations, including different laws for errors of star catalogue versus spherical coordinates. The best relations have been applied to real observations of Ceres, in order to obtain elements and star catalogue corrections. Preliminary results of these calculations are presented.

PhysicsSystematic errorSpherical coordinate systemAstronomyA* search algorithmAstronomy and AstrophysicsAstrophysics::Cosmology and Extragalactic AstrophysicsAstrophysicsStar cataloguelaw.inventionSpace and Planetary SciencelawOrbit (dynamics)Astrophysics::Earth and Planetary AstrophysicsOrbit determinationAstrophysics::Galaxy AstrophysicsPlanetary and Space Science
researchProduct

Grover’s Search with Faults on Some Marked Elements

2018

Grover’s algorithm is a quantum query algorithm solving the unstructured search problem of size [Formula: see text] using [Formula: see text] queries. It provides a significant speed-up over any classical algorithm [3]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [2, 6]. We study the behavior of Grover’s algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in [Formula: see text] queries. We also analyze…

Quantum queryComputational complexity theoryComputer science0103 physical sciencesComputer Science (miscellaneous)Search problemFault toleranceQuantum search algorithm010306 general physics01 natural sciencesAlgorithm010305 fluids & plasmasInternational Journal of Foundations of Computer Science
researchProduct

Combined IT and power supply infrastructure sizing for standalone green data centers

2021

International audience; In this work, we propose a two-step methodology for designing and sizing a data center solely powered by local renewable energy. The first step consists in determining the necessary IT equipment for processing a given IT workload composed of batch and service tasks. We propose an adapted binary search algorithm and prove its optimality to find the minimum number of servers to handle the IT workload. When the IT sizing is computed, the second step consists in defining the supplying electrical infrastructure using wind turbines and photovoltaic panels as primary sources. Batteries and a hydrogen system are added as secondary sources for short- and long-term energy stor…

Renewable energyBinary search algorithmWind powerGeneral Computer Sciencebusiness.industryComputer scienceInfrastructure sizing020209 energyReal-time computingPhotovoltaic systemSustainable Computing: Informatics and Systems Renewable energy020206 networking & telecommunicationsWorkload02 engineering and technology7. Clean energyGreen data centerSizingEnergy storageServer0202 electrical engineering electronic engineering information engineeringData center[INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Electrical and Electronic EngineeringbusinessSustainable Computing: Informatics and Systems
researchProduct

Fragtique: Applying an OO Database Distribution Strategy to Data Warehouse

2001

We propose a strategy for distribution of a relational data warehouse organized according to a star schema. We adapt fragmentation and allocation strategies that were developed for OO databases. We split the most-often-accessed dimension table into fragments by using primary horizontal fragmentation. The derived fragmentation then divides the fact table into fragments. Other dimension tables are not fragmented since they are presumed to be sufficiently small. Allocation of fragments encompasses duplication of non-fragmented dimension tables that we call a closure.

Theoretical computer scienceDatabaseComputer scienceRelational databaseFragmentation (computing)Dimension tableA* search algorithmFact tablecomputer.software_genreData warehouselaw.inventionData cubelawSchema (psychology)Data miningcomputer
researchProduct

Urban drinking and driving:comparison of electric scooter and bicycle related accidents in facial fracture patients

2022

In recent years, electric scooters (e-scooter) have emerged as an alternative mode of urban transport due to their availability and effortless use. However, e-scooter-related trauma and injuries, especially to the head, have received wide media coverage and raised public concern about their safety. We aim to determine and compare clinically relevant variables, incidence, and severity between bicycle and e-scooter-related facial fractures and potential protective measures for injury prevention. This retrospective study comprised all patients admitted to a tertiary trauma center with bicycle or e-scooter-related facial fractures between January 2019 and October 2020. Patient- and injury-relat…

and alveolar ridge augmentation. to assess the risk of biasand scopus. the search algorithms used the following key words: stem cellsbone rehabilitationOtorhinolaryngologybone regenerationstem cellstissue engineeringmedline completeSurgerythe study was developed following the criteria of the prisma guideline (2020). the literature review was conducted in pubmedGeneral Dentistryalveolar bone atrophyUNESCO:CIENCIAS MÉDICASthe caspe methodology was used
researchProduct

Change-point estimation in piecewise constant regression models with random effects

2014

We propose an iterative algorithm to estimate change-points in general regression models. The algorithm avoids grid search to obtain maximum likelihood estimates, and thus it guarantees moderate computational time regardless of the sample size and the number of change-points to be estimated. Furthermore, it allows estimation in random effects models, where grid search is unfeasible. We present the proposed approach in practice by analyzing variations of lung functionality on a sample of transplant recipients.

change-points piecewise constant grid search algorithmSettore SECS-S/01 - Statistica
researchProduct