Listing 1 - 10 of 15 | << page >> |
Sort by
|
Choose an application
Computer science --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms.
Choose an application
Numerical analysis --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Ordinateurs simultanés --- Parallel computers --- Simultaancomputers --- Parallel algorithms --- Parallel algorithms. --- Computer algorithms. --- Parallel computers.
Choose an application
Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Transformaties (Wiskunde) --- Transformations (Mathematics) --- Transformations (Mathematiques) --- Pattern perception --- Algorithmes --- Transformations (Mathématiques) --- Mathematics --- Transformations (Mathématiques)
Choose an application
Numerical analysis --- Computer science --- Computer algorithms --- Algorithmes --- Computer algorithms. --- 519.682 --- 681.3*F2 --- Algorithms --- Programming languages. Metalanguages --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 519.682 Programming languages. Metalanguages --- Algorithmes (Ordinateur) --- Algoritmen (Computer)
Choose an application
This book is the final report on a comprehensive basic research project, named GOSLER on algorithmic learning for knowledge-based systems supported by the German Federal Ministry of Research and Technology during the years 1991 - 1994. This research effort was focused on the study of fundamental learnability problems integrating theoretical research with the development of tools and experimental investigation. The contributions by 11 participants in the GOSLER project is complemented by contributions from 23 researchers from abroad. Thus the volume provides a competent introduction to algorithmic learning theory.
Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Expert systems (Computer science) --- Expertsystemen (Informatica) --- Systèmes experts (Informatique) --- Computer algorithms. --- Information theory. --- Artificial intelligence. --- Computer science. --- Theory of Computation. --- Artificial Intelligence. --- Mathematical Logic and Formal Languages. --- Informatics --- Science --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Communication theory --- Communication --- Cybernetics
Choose an application
Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.
Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Data processing [Electronic ] --- Electronic data processing --- Elektronische gegevensverwerking --- Gegevensverwerking [Electronische ] --- Grafentheorie --- Graph theory --- Graphes [Théorie des ] --- Théorie des graphes --- Traitement électronique des données --- Electronic data processing. --- Computer algorithms. --- Computer software. --- Combinatorics. --- Computer science. --- Operating systems (Computers). --- Algorithm Analysis and Problem Complexity. --- Computation by Abstract Devices. --- Operating Systems. --- Computer operating systems --- Computers --- Disk operating systems --- Systems software --- Informatics --- Science --- Combinatorics --- Algebra --- Mathematical analysis --- Software, Computer --- Computer systems --- Operating systems
Choose an application
This work presents recent developments in hashing algorithm design. Hashing is the process of creating a short digest (i.e., 64 bits) for a message of arbitrary length, for exam- ple 20 Mbytes. Hashing algorithms were first used for sear- ching records in databases; they are central for digital si- gnature applications and are used for authentication without secrecy. Covering all practical and theoretical issues related to the design of secure hashing algorithms the book is self contained; it includes an extensive bibliography on the topic.
Adressage calculé (Informatique) --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Computer security --- Computerbeveiliging --- Computers--Beveiliging --- Hash coding (Computer science) --- Hashing (Computer science) --- Hashing (Computerleer) --- Informatique--Sécurité --- Sécurité informatique --- Computer algorithms. --- Computer security. --- Algorithmes --- Hashing (Computer science). --- Sécurité informatique --- Data structures (Computer scienc. --- Data encryption (Computer science). --- Coding theory. --- Combinatorics. --- Computer software. --- Operating systems (Computers). --- Data Structures. --- Cryptology. --- Coding and Information Theory. --- Algorithm Analysis and Problem Complexity. --- Operating Systems. --- Computer operating systems --- Computers --- Disk operating systems --- Systems software --- Software, Computer --- Computer systems --- Combinatorics --- Algebra --- Mathematical analysis --- Data compression (Telecommunication) --- Digital electronics --- Information theory --- Machine theory --- Signal theory (Telecommunication) --- Computer programming --- Data encoding (Computer science) --- Encryption of data (Computer science) --- Cryptography --- Operating systems
Choose an application
The notion of time plays an important role in modern science. In computer science and artificial intelligence, the parameter of time is of particular importance, e.g. for planning robot activity, natural language processing, and time-varying scene analysis. This work investigates the relationship between classic, first-order theories of point- and interval-based time structures, modal logics of corresponding structures, and their algorithmic representations. To make this relationship complete, a formalisation of Allen's famous algorithm, applicable to various structures of time, is presented along with its translation to modal logics. All in all, the book is a competent and comprehensive analysis of logical descriptions and algorithmic representations of time structures.
AI(Artificial intelligence) --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Artificial intelligence --- Artificial thinking --- Artificiële intelligentie --- Computer algorithms --- Electronic brains --- Intellectronics --- Intelligence [Artificial ] --- Intelligence artificielle --- Intelligent machines --- Kunstmatige intelligentie --- Machine intelligence --- Temps --- Thinking [Artificial ] --- Tijd --- Time --- Computer algorithms. --- Time. --- Artificial intelligence. --- Cerveaux électroniques --- Machines intelligentes --- Pensée artificielle --- Computer science. --- Artificial Intelligence. --- Mathematical Logic and Formal Languages. --- Informatics --- Science --- AI (Artificial intelligence) --- Intelligence, Artificial --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers
Choose an application
Computer science --- Artificial intelligence. Robotics. Simulation. Graphics --- Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Computer programs --- Computerprogramma's --- Data structures (Computer science) --- Données [Structures de ] (Informatique) --- Gegevensstructuren (Informatica) --- Programmes d'ordinateur --- Structures de données (Informatique) --- 681.3*I28 --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- Electronic data processing --- File organization (Computer science) --- Abstract data types (Computer science) --- Computer program files --- Files, Computer program --- Program files, Computer --- Programs, Computer --- Computer files --- Computer software --- Algorithms --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- Computer algorithms. --- Computer programs. --- Data structures (Computer science). --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22}
Choose an application
Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems.
Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Computer algorithms --- Data structures (Computer science) --- Données [Structures de ] (Informatique) --- Gegevensstructuren (Informatica) --- Structures de données (Informatique) --- 681.3*H28 --- -Data structures (Computer science) --- -681.3*A0 --- Algorithms --- Database applications --- Congresses --- General --- Congresses. --- 681.3*A0 General --- 681.3*H28 Database applications --- 681.3*A0 --- Information theory. --- Computer science. --- Computer network architectures. --- Computer software. --- Computer graphics. --- Data structures (Computer scienc. --- Theory of Computation. --- Programming Techniques. --- Computer System Implementation. --- Algorithm Analysis and Problem Complexity. --- Computer Graphics. --- Data Structures. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Software, Computer --- Computer systems --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Digital techniques
Listing 1 - 10 of 15 | << page >> |
Sort by
|