Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen
| Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen |
| Autore | Cooper S. B (S. Barry) |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxi, 914 pages) : illustrations (some color) |
| Disciplina |
510.92
B |
| Collana | Gale eBooks |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910779414203321 |
Cooper S. B (S. Barry)
|
||
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen
| Alan Turing : his work and impact / / edited by S. Barry Cooper and Jan van Leeuwen |
| Autore | Cooper S. B (S. Barry) |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (xxi, 914 pages) : illustrations (some color) |
| Disciplina |
510.92
B |
| Collana | Gale eBooks |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910823942503321 |
|
Cooper S. B (S. Barry)
|
||
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Alan Turing [[electronic resource] ] : his work and impact / / edited by S. Barry Cooper and J. van Leeuwen
| Alan Turing [[electronic resource] ] : his work and impact / / edited by S. Barry Cooper and J. van Leeuwen |
| Pubbl/distr/stampa | Amsterdam ; ; Boston, : Elsevier, 2013 |
| Descrizione fisica | 1 online resource (937 p.) |
| Disciplina |
510.92
B |
| Altri autori (Persone) |
CooperS. B (S. Barry)
LeeuwenJ. van (Jan) |
| Soggetto topico |
Mathematicians - Great Britain
Computer science - Mathematics Enigma cipher system Logic, Symbolic and mathematical |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-299-38603-2
0-12-387012-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | pt. 1. How do we compute? what can we prove? -- pt. 2. Hiding and unhiding information : cryptology, complexity and number theory -- pt. 3. Building a brain : intelligent machines, practice and theory -- pt. 4. The mathematics of emergence : the mysteries of morphogenesis. |
| Record Nr. | UNINA-9910452723403321 |
| Amsterdam ; ; Boston, : Elsevier, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
PARLE '91, Parallel Architectures and Languages Europe . Volume I. : Parallel Architectures and Algorithms Eindhoven, the Netherlands, June 10-13, 1991 Proceedings / / Emile H.L. Aarts, Jan van Leeuwen, Martin Rem, editors
| PARLE '91, Parallel Architectures and Languages Europe . Volume I. : Parallel Architectures and Algorithms Eindhoven, the Netherlands, June 10-13, 1991 Proceedings / / Emile H.L. Aarts, Jan van Leeuwen, Martin Rem, editors |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , 1991 |
| Descrizione fisica | 1 online resource (XXX, 918 p.) |
| Disciplina | 004.35 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Parallel computers |
| ISBN | 3-662-25209-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Parallel Evaluation of Functional Programs: The ?v, G?-machine approach (Summary) -- Towards a Single Model of Efficient Computation in Real Parallel Machines -- Neural Computing and the GALATEA Project -- Submitted Presentations -- A Novel High-Speed Memory Organization for Fine-Grain Multi-Thread Computing -- Evaluation of Futurebus hierarchical caching -- Efficient Global Computations on a Processor Network with Programmable Logic -- POMP or How to design a massively parallel machine with small developments -- The Function Processor: An Architecture for Efficient Execution of Recursive Functions -- The G-Line a Distributed Processor for Graph Reduction -- The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract) -- Indirect Reference Counting: A Distributed Garbage Collection Algorithm -- Periodic Multiprocessor Scheduling -- Embeddings of shuffle-like graphs in hypercubes -- Mapping Uniform Recurrences onto Small Size Arrays -- Area Complexity of Multilective Merging -- Deriving Fully Efficient Systolic Arrays by Quasi-Linear Allocation Functions -- Affine Timings for Systems of Affine Recurrence Equations -- On the Computational Complexity of Optimal Sorting Network Verification -- Managing a Parallel Heap Efficiently -- Parallel complexity in the design and analysis of concurrent systems -- FORK: A High-Level Language for PRAMs -- Neural Network-Based Decision Making for Large Incomplete Databases -- An Optical Content-Addressable Parallel Processor for Fast Searching and Retrieving -- Towards an Efficient Hybrid Dataflow Architecture Model -- Data Flow Implementation of Generalized Guarded Commands -- On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies -- A Toolkit for Debugging Parallel Lisp Programs -- Invited Lectures -- Loosely-Coupled Processes (Preliminary Version) -- Rendez-Vous with Metric Semantics -- Embeddings Among Concurrent Programming Languages -- Submitted Presentations -- Invariants and Paradigms of Concurrency Theory -- Acceptance Automata: A Framework for Specifying and Verifying TCSP Parallel Systems -- Models for dynamically placed concurrent processes -- Formalisation of the Behavior of Actors by Colored Petri Nets and Some Applications -- Program Refinement in Fair Transition Systems -- Communication Abstraction and Refinement -- On the semantics of languages for massively parallel SIMD architectures -- A Denotational Real-Time Semantics for Shared Processors -- Concurrent Clean -- The Scriptic Programming Language -- Structural Operational Semantics for Kernel Andorra Prolog -- Customization of First-Class Tuple-Spaces in a Higher-Order Language -- A Formal Specification of the Process Trellis -- Strong Bisimilarity on Nets Revisited -- A Configuration Approach to Parallel Programming -- Chaotic Linear System Solvers in a Variable-Grain Data-Driven Multiprocessor System -- Parallel Associative Combinator Evaluation -- Static Analysis of Term Graph Rewriting Systems -- Scheduling of OR-parallel Prolog on a Scalable, Reconfigurable, Distributed-Memory Multiprocessor -- Flexible Scheduling of Or-parallelism in Aurora: The Bristol Scheduler -- Virtual Memory Support for OR-Parallel Logic Programming Systems -- Interfacing Engines and Schedulers in Or-Parallel Prolog Systems -- Reduction of Code Space in Parallel Logic Programming Systems -- Search Level Parallel Processing of Production Systems. |
| Record Nr. | UNISA-996466040403316 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2007: Theory and Practice of Computer Science [[electronic resource] ] : 33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings / / edited by Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, František Plášil
| SOFSEM 2007: Theory and Practice of Computer Science [[electronic resource] ] : 33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings / / edited by Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, František Plášil |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (955 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computer networks Database management Information storage and retrieval systems Application software Theory of Computation Software Engineering Computer Communication Networks Database Management Information Storage and Retrieval Computer and Information Systems Applications |
| ISBN |
1-280-95555-4
9786610955558 3-540-69507-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Graphs from Search Engine Queries -- Model-Checking Large Finite-State Systems and Beyond -- Interaction and Realizability -- A Short Introduction to Computational Social Choice -- Distributed Models and Algorithms for Mobile Robot Systems -- Point-to-Point Shortest Path Algorithms with Preprocessing -- Games, Time, and Probability: Graph Models for System Design and Analysis -- Agreement Technologies -- Automatic Testing of Object-Oriented Software -- Architecture-Based Reasoning About Performability in Component-Based Systems -- Multimedia Retrieval Algorithmics -- Foundations of Computer Science -- Size of Quantum Finite State Transducers -- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles -- Straightening Drawings of Clustered Hierarchical Graphs -- Improved Upper Bounds for ?-Backbone Colorings Along Matchings and Stars -- About the Termination Detection in the Asynchronous Message Passing Model -- Fast Approximate Point Set Matching for Information Retrieval -- A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks -- Compressed Prefix Sums -- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem -- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs -- Exact Max 2-Sat: Easier and Faster -- Maximum Finding in the Symmetric Radio Networks with Collision Detection -- An Approach to Modelling and Verification of Component Based Systems -- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages -- On the (High) Undecidability of Distributed Synthesis Problems -- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks -- Online Service Management Algorithm for Cellular/WALN Multimedia Networks -- A Simple Algorithm for Stable Minimum Storage Merging -- Generating High Dimensional Data and Query Sets -- Partial vs. Complete Domination: t-Dominating Set -- Estimates of Data Complexity in Neural-Network Learning -- Concurrent and Located Synchronizations in ?-Calculus -- Efficient Group Key Agreement for Dynamic TETRA Networks -- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks -- The P k Partition Problem and Related Problems in Bipartite Graphs -- Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces -- A Model of an Amorphous Computer and Its Communication Protocol -- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems -- Indexing Factors with Gaps -- Information Efficiency -- Deterministic Simulation of a NFA with k–Symbol Lookahead -- Mobility Management Using Virtual Domain in IPv6-Based Cellular Networks -- Restarting Tree Automata -- A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3 -- Formal Translation Directed by Parallel LLP Parsing -- Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast -- A Language for Reliable Service Composition -- Operational Semantics of Framed Temporal Logic Programs -- Constraints for Argument Filterings -- Multi-agent Systems -- Performance Analysis of a Multiagent Architecture for Passenger Transportation -- Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition -- FTTH-Enhanced Mini-System m TBCP-Based Overlay Construction and Evaluation -- On Efficient Resource Allocation in Communication Networks -- Protecting Agent from Attack in Grid ComputingIII -- Incremental Learning of Planning Operators in Stochastic Domains -- Competitive Contract Net Protocol -- Agent Oriented Methodology Construction and Customization with HDA -- Emerging Web Technologies -- Building an Ontological Base for Experimental Evaluation of Semantic Web Applications -- Semantic Web Approach in Designing a Collaborative E-Item Bank System -- A Hybrid Region Weighting Approach for Relevance Feedback in Region-Based Image Search on the Web -- Rapid Development of Web Interfaces to Heterogeneous Systems -- Enhancing Security by Embedding Biometric Data in IP Header -- Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message Brokers -- A Semantic Peer-to-Peer Overlay for Web Services Discovery -- Multi-document Summarization Based on Cluster Using Non-negative Matrix Factorization -- A Program Slicing Based Method to Filter XML/DTD Documents -- A Hybrid Approach for XML Similarity -- Personalized Presentation in Web-Based Information Systems -- Immune-Inspired Online Method for Service Interactions Detection -- Dependable Software and Systems -- Separation of Concerns and Consistent Integration in Requirements Modelling -- Checking Interaction Consistency in MARMOT Component Refinements -- Towards a Versatile Contract Model to Organize Behavioral Specifications -- Improved Processing of Textual Use Cases: Deriving Behavior Specifications -- A Dialogue-Based NLIDB System in a Schedule Management Domain -- Experimental Assessment of the Practicality of a Fault-Tolerant System -- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems -- Extracting Zing Models from C Source Code -- Parameterised Extra-Functional Prediction of Component-Based Control Systems – Industrial Experience -- Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems. |
| Record Nr. | UNISA-996465336903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2007: Theory and Practice of Computer Science : 33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings / / edited by Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, František Plášil
| SOFSEM 2007: Theory and Practice of Computer Science : 33nd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings / / edited by Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, František Plášil |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (955 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computer networks Database management Information storage and retrieval systems Application software Theory of Computation Software Engineering Computer Communication Networks Database Management Information Storage and Retrieval Computer and Information Systems Applications |
| ISBN |
1-280-95555-4
9786610955558 3-540-69507-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Graphs from Search Engine Queries -- Model-Checking Large Finite-State Systems and Beyond -- Interaction and Realizability -- A Short Introduction to Computational Social Choice -- Distributed Models and Algorithms for Mobile Robot Systems -- Point-to-Point Shortest Path Algorithms with Preprocessing -- Games, Time, and Probability: Graph Models for System Design and Analysis -- Agreement Technologies -- Automatic Testing of Object-Oriented Software -- Architecture-Based Reasoning About Performability in Component-Based Systems -- Multimedia Retrieval Algorithmics -- Foundations of Computer Science -- Size of Quantum Finite State Transducers -- Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles -- Straightening Drawings of Clustered Hierarchical Graphs -- Improved Upper Bounds for ?-Backbone Colorings Along Matchings and Stars -- About the Termination Detection in the Asynchronous Message Passing Model -- Fast Approximate Point Set Matching for Information Retrieval -- A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks -- Compressed Prefix Sums -- On Optimal Solutions for the Bottleneck Tower of Hanoi Problem -- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs -- Exact Max 2-Sat: Easier and Faster -- Maximum Finding in the Symmetric Radio Networks with Collision Detection -- An Approach to Modelling and Verification of Component Based Systems -- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages -- On the (High) Undecidability of Distributed Synthesis Problems -- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks -- Online Service Management Algorithm for Cellular/WALN Multimedia Networks -- A Simple Algorithm for Stable Minimum Storage Merging -- Generating High Dimensional Data and Query Sets -- Partial vs. Complete Domination: t-Dominating Set -- Estimates of Data Complexity in Neural-Network Learning -- Concurrent and Located Synchronizations in ?-Calculus -- Efficient Group Key Agreement for Dynamic TETRA Networks -- Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks -- The P k Partition Problem and Related Problems in Bipartite Graphs -- Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces -- A Model of an Amorphous Computer and Its Communication Protocol -- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems -- Indexing Factors with Gaps -- Information Efficiency -- Deterministic Simulation of a NFA with k–Symbol Lookahead -- Mobility Management Using Virtual Domain in IPv6-Based Cellular Networks -- Restarting Tree Automata -- A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3 -- Formal Translation Directed by Parallel LLP Parsing -- Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast -- A Language for Reliable Service Composition -- Operational Semantics of Framed Temporal Logic Programs -- Constraints for Argument Filterings -- Multi-agent Systems -- Performance Analysis of a Multiagent Architecture for Passenger Transportation -- Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition -- FTTH-Enhanced Mini-System m TBCP-Based Overlay Construction and Evaluation -- On Efficient Resource Allocation in Communication Networks -- Protecting Agent from Attack in Grid ComputingIII -- Incremental Learning of Planning Operators in Stochastic Domains -- Competitive Contract Net Protocol -- Agent Oriented Methodology Construction and Customization with HDA -- Emerging Web Technologies -- Building an Ontological Base for Experimental Evaluation of Semantic Web Applications -- Semantic Web Approach in Designing a Collaborative E-Item Bank System -- A Hybrid Region Weighting Approach for Relevance Feedback in Region-Based Image Search on the Web -- Rapid Development of Web Interfaces to Heterogeneous Systems -- Enhancing Security by Embedding Biometric Data in IP Header -- Runtime-Efficient Approach for Multiple Continuous Filtering in XML Message Brokers -- A Semantic Peer-to-Peer Overlay for Web Services Discovery -- Multi-document Summarization Based on Cluster Using Non-negative Matrix Factorization -- A Program Slicing Based Method to Filter XML/DTD Documents -- A Hybrid Approach for XML Similarity -- Personalized Presentation in Web-Based Information Systems -- Immune-Inspired Online Method for Service Interactions Detection -- Dependable Software and Systems -- Separation of Concerns and Consistent Integration in Requirements Modelling -- Checking Interaction Consistency in MARMOT Component Refinements -- Towards a Versatile Contract Model to Organize Behavioral Specifications -- Improved Processing of Textual Use Cases: Deriving Behavior Specifications -- A Dialogue-Based NLIDB System in a Schedule Management Domain -- Experimental Assessment of the Practicality of a Fault-Tolerant System -- A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems -- Extracting Zing Models from C Source Code -- Parameterised Extra-Functional Prediction of Component-Based Control Systems – Industrial Experience -- Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems. |
| Record Nr. | UNINA-9910483809003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||