Results 261 to 270 of about 10,989,460 (301)
Some of the next articles are maybe not open access.

Scalability of algorithms: An analytic approach

Parallel Computing, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dieter Müller-Wichards   +1 more
openaire   +2 more sources

Alternative Approaches and Algorithms for Classification

2006
In this work, four alternative algorithms for Classification/ Discrimination are described which we have developed recently. These are believed to have several advantages over the previous ones via the introduction of a new concept, Centers of Masses for classes, and new cost functions which enforce clustering of different classes more explicitly ...
Askin Demirkol, Zafer Demir, Erol Emre
openaire   +1 more source

An algorithmic approach to aspergillus sinusitis

The Journal of Laryngology & Otology, 1994
AbstractThe effective management of paranasal sinus aspergillosis requires early diagnosis, histological classification, surgery and where appropriate, chemotherapy. Fungal sinusitis may be easily missed unless a high index of suspicion is maintained and specific culture and histology requested.
de Carpentier, J. P.   +3 more
openaire   +2 more sources

A Statistical Approach for Algorithm Selection

2004
This paper deals with heuristic algorithm characterization, which is applied to the solution of an NP-hard problem, in order to select the best algorithm for solving a given problem instance. The traditional approach for selecting algorithms compares their performance using an instance set, and concludes that one outperforms the other.
Joaquín Pérez Ortega   +5 more
openaire   +1 more source

A new approach to learning algorithms

International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004., 2004
Algorithm visualization aims to facilitate the understanding of algorithms by using graphics and animation to reify the execution of an algorithm on selected input data. However, many current visualization techniques suffer from a variety of problems, such as lack of focus, presentation at a single level of abstraction, and concentration on low-level ...
Tomasz Müldner, Elhadi M. Shakshuki
openaire   +2 more sources

An algorithmic approach to characterizations of admissibles

2019
Sacks proved that every admissible countable ordinal is the first admissible ordinal relatively to a real. We give an algorithmic proof of this result for constructibly countable admissibles. Our study is completed by an algorithmic approach to a generalization of Sacks’ theorem due to Jensen, that finds a real relatively to which a countable sequence ...
Durand, Bruno, Lafitte, Grégory
openaire   +3 more sources

Algorithmic Approaches for Storage Networks

2003
Persistent storage in modern computers is usually realized by magnetic hard disk drives. They form the last, and therefore the slowest level in the memory hierarchy. Disk drive technology is very sophisticated and complex, making an accelerated growth in disk capacity possible.
openaire   +2 more sources

A Connectionist Approach to Algorithmic Composition

Computer Music Journal, 1989
With the advent of von Neumann-style computers, widespread exploration of new methods of music composition became possible. For the first time, complex sequences of carefully specified symbolic operations could be performed in a rapid fashion. Composers could develop algorithms embodying the compositional rules they were interested in and then use a ...
openaire   +1 more source

Sensitivity in DEA: an algorithmic approach

Central European Journal of Operations Research, 2018
This paper considers an algorithmic approach to sensitivity in Data Envelopment Analysis for the CCR and Additive models. Specifically, it gives sufficient conditions that preserve the efficiency of a decision-making unit (DMU) under arbitrary perturbations of the inputs and/or outputs of the DMUs.
Luka Neralic, Richard E. Wendell
openaire   +5 more sources

An algorithmic approach to knowledge evolution

Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 1999
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases in societies of agents. Halpern and Vardi have proposed the notion of refinement of S5n Kripke models in order to solve multi-agent problems in which knowledge evolves.
Alessio Lomuscio, Mark Ryan 0001
openaire   +2 more sources

Home - About - Disclaimer - Privacy