Advances in computing and information--ICCI '90 / / International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, proceedings ; S.G. Akl, F. Fiala, W.W. Koczkodaj (eds.) |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer-Verlag, c1990 |
Descrizione fisica | 1 online resource |
Disciplina | 004 |
Altri autori (Persone) |
AklSelim G
FialaF KoczkodajWaldemar W. <1951-> |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer science
Information technology |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465389003316 |
Berlin ; ; New York, : Springer-Verlag, c1990 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Data Structures [[electronic resource] ] : 4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings / / edited by Selim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
Edizione | [1st ed. 1995.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
Descrizione fisica | 1 online resource (X, 526 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Computer programming Algorithms Data structures (Computer science) Computer graphics Theory of Computation Programming Techniques Computation by Abstract Devices Algorithm Analysis and Problem Complexity Data Structures Computer Graphics |
ISBN | 3-540-44747-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Lower bounds to processor-time tradeoffs under bounded-speed message propagation -- The two-line center problem from a polar view: a new algorithm and data structure -- On some geometric selection and optimization problems via sorted matrices -- Load balancing in quorum systems -- Balanced distributed search trees do not exist -- Two-floodlight illumination of convex polygons -- On the complexity of approximating and illuminating three-dimensional convex polyhedra -- Scheduling jobs that arrive over time -- Dynamic algorithms for the Dyck languages -- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications -- Computing a shortest watchman path in a simple polygon in polynomial-time -- Going home through an unknown street -- Page migration with limited local memory capacity -- Randomized algorithms for metrical task systems -- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining -- Computing common tangents without a separating line -- Online perfect matching and mobile computing -- Competitive algorithms for the on-line traveling salesman -- Quadrangulations of planar sets -- A linear-time construction of the relative neighborhood graph within a histogram -- Computing proximity drawings of trees in the 3-dimensional space -- Routing on trees via matchings -- A ranking algorithm for Hamilton paths in shuffle-exchange graphs -- Amortization results for chromatic search trees, with an application to priority queues -- Fast meldable priority queues -- On the computation of fast data transmissions in networks with capacities and delays -- Routing with delays when storage is costly -- Algorithmic arguments in physics of computation -- The buffer tree: A new technique for optimal I/O-algorithms -- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep -- Computing a dominating pair in an asteroidal triple-free graph in linear time -- A linear algorithm for the maximal planar subgraph problem -- Topology B-trees and their applications -- In-place calculation of minimum-redundancy codes -- Regular-factors in the complements of partial k-trees -- Obstructions to within a few vertices or edges of acyclic -- Faster enumeration of all spanning trees of a directed graph -- A simpler minimum spanning tree verification algorithm -- On approximation properties of the Independent set problem for degree 3 graphs -- Approximation of Constraint Satisfaction via local search -- On the difficulty of range searching -- Tables should be sorted (on random access machines) -- Improved length bounds for the shortest superstring problem -- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) -- Experiences with the implementation of geometric algorithms. |
Record Nr. | UNISA-996466132503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Unconventional Computation [[electronic resource] ] : 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings / / edited by Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, H. Todd Wareham |
Autore | Akl Selim G. |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (X, 246 p.) |
Disciplina | 006.3 |
Altri autori (Persone) | AklSelim G |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence
Computer science Algorithms Bioinformatics Artificial Intelligence Theory of Computation Computational and Systems Biology |
ISBN | 3-540-73554-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- How Neural Computing Can Still Be Unconventional After All These Years -- Optimal Algorithmic Cooling of Spins -- Nanocomputing by Self-assembly -- Organic User Interfaces (Oui!): Designing Computers in Any Way Shape or Form -- Regular Papers -- Unconventional Models of Computation Through Non-standard Logic Circuits -- Amoeba-Based Nonequilibrium Neurocomputer Utilizing Fluctuations and Instability -- Unconventional “Stateless” Turing–Like Machines -- Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode -- On One Unconventional Framework for Computation -- Computing Through Gene Assembly -- Learning Vector Quantization Network for PAPR Reduction in Orthogonal Frequency Division Multiplexing Systems -- Binary Ant Colony Algorithm for Symbol Detection in a Spatial Multiplexing System -- Quantum Authenticated Key Distribution -- The Abstract Immune System Algorithm -- Taming Non-compositionality Using New Binders -- Using River Formation Dynamics to Design Heuristic Algorithms -- Principles of Stochastic Local Search -- Spatial and Temporal Resource Allocation for Adaptive Parallel Genetic Algorithm -- Gravitational Topological Quantum Computation -- Computation in Sofic Quantum Dynamical Systems -- Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing. |
Record Nr. | UNISA-996465645603316 |
Akl Selim G. | ||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Unconventional Computation : 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings / / edited by Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, H. Todd Wareham |
Autore | Akl Selim G. |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (X, 246 p.) |
Disciplina | 006.3 |
Altri autori (Persone) | AklSelim G |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence
Computer science Algorithms Bioinformatics Artificial Intelligence Theory of Computation Computational and Systems Biology |
ISBN | 3-540-73554-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- How Neural Computing Can Still Be Unconventional After All These Years -- Optimal Algorithmic Cooling of Spins -- Nanocomputing by Self-assembly -- Organic User Interfaces (Oui!): Designing Computers in Any Way Shape or Form -- Regular Papers -- Unconventional Models of Computation Through Non-standard Logic Circuits -- Amoeba-Based Nonequilibrium Neurocomputer Utilizing Fluctuations and Instability -- Unconventional “Stateless” Turing–Like Machines -- Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode -- On One Unconventional Framework for Computation -- Computing Through Gene Assembly -- Learning Vector Quantization Network for PAPR Reduction in Orthogonal Frequency Division Multiplexing Systems -- Binary Ant Colony Algorithm for Symbol Detection in a Spatial Multiplexing System -- Quantum Authenticated Key Distribution -- The Abstract Immune System Algorithm -- Taming Non-compositionality Using New Binders -- Using River Formation Dynamics to Design Heuristic Algorithms -- Principles of Stochastic Local Search -- Spatial and Temporal Resource Allocation for Adaptive Parallel Genetic Algorithm -- Gravitational Topological Quantum Computation -- Computation in Sofic Quantum Dynamical Systems -- Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing. |
Record Nr. | UNINA-9910483475203321 |
Akl Selim G. | ||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|