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.
Algorithms [[electronic resource] ] : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings / / edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
| Algorithms [[electronic resource] ] : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings / / edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (X, 482 p.) |
| Disciplina | 511/.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Electrical engineering Operations research Decision making Algorithms Combinatorics Theory of Computation Electrical Engineering Operations Research/Decision Theory Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-47177-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity in multiple and capacitated graphs -- Efficient sequential and parallel algorithms for planar minimum cost flow -- Structural analyses on the complexity of inverting functions -- Oracles versus proof techniques that do not relativize -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel graphs and their applications -- Parallel algorithms for generating subsets and set partitions -- Parallel algorithms for linked list and beyond -- Local tournaments and proper circular arc graphs -- Fast algorithms for the dominating set problem on permutation graphs -- Two probabilistic results on merging -- Randomized broadcast in networks -- On the construction of abstract voronoi diagrams, II -- Searching in higher dimension -- Finding extrema with unary predicates -- Implicitly searching convolutions and computing depth of collision -- Characterization for a family of infinitely many irreducible Equally Spaced Polynomials -- Distributed algorithms for deciphering -- An efficient algorithm for optimal loop parallelization (extended abstract) -- Another view on the SSS* algorithm -- Algorithms from complexity theory: Polynomial-time operations for complex sets -- Complexity cores and hard problem instances -- Spatial point location and its applications -- Sublinear merging and natural merge sort -- Constructing strongly convex approximate hulls with inaccurate primitives -- Computing puiseux-series solutions to determinatal equations via combinatorial relaxation -- A tight lower bound on the size of planar permutation networks -- Simultaneous solution of families of problems -- Algorithms for projecting points to give the most uniform distribution with applications to hashing -- Topological sweeping in three dimensions -- Finding least-weight subsequences with fewer processors -- Derandomization by exploiting redundancy and mutual independence -- Planar separators and the Euclidean norm -- On the complexity of isometric embedding in the hypercube -- Distributed function evaluation in the presence of transmission faults -- Optimal linear broadcast -- Graph augmentation problems for a specified set of vertices -- A heuristic algorithm for the k-center problem with vertex weight -- Parallel convexity algorithms for digitized images on a linear array of processors -- Parallel algorithms for labeling image components -- A hyperplane Incidence problem with applications to counting distances -- Splitting a configuration in a simplex -- Weaving patterns of lines and line segments in space -- Efficient parallel algorithms for path problems in planar directed graphs -- Parallel algorithms for finding Steiner forests in planar graphs -- Optimally managing the history of an evolving forest. |
| Record Nr. | UNISA-996465865803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain
| Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVII, 435 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer mathematics Numerical analysis Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computational Mathematics and Numerical Analysis Numeric Computing |
| ISBN | 3-540-69662-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists. |
| Record Nr. | UNINA-9910144902203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain
| Algorithms and Computation [[electronic resource] ] : 8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings. / / edited by Hon Wai Leong, Hiroshi Imai, Sanjay Jain |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVII, 435 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer mathematics Numerical analysis Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computational Mathematics and Numerical Analysis Numeric Computing |
| ISBN | 3-540-69662-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Solving NP-hard combinatorial problems in the practical sense Invited presentation -- Airline crew-scheduling problem with many irregular flights -- Practical approach to a facility location problem for large-scale logistics -- Hard instance generation for SAT -- Playing tetris on meshes and multi-dimensional Shearsort -- Formulation of the addition-shift-sequence problem and its complexity -- Weighted and unweighted selection algorithms for k sorted sequences -- An adaptive distributed fault-tolerant routing algorithm for the star graph -- Multi-color routing in the undirected hypercube -- Competitive source routing on tori and meshes -- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs -- Augmenting edge and vertex connectivities simultaneously -- Two-face horn extensions -- Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae -- Algorithmic analysis of multithreaded algorithms -- A characterization of planar graphs by pseudo-line arrangements -- Optimal fault-tolerant broadcasting in trees -- A theoretical framework of hybrid approaches to MAX SAT -- Exponential lower bounds on the size of OBDDs representing integer division -- On-line versus off-line in money-making strategies with brokerage -- Decision-making by hierarchies of discordant agents -- A new efficient off-line anonymous cash scheme -- Approximating unweighted connectivity problems in parallel -- A randomized linear work EREW PRAM algorithm to find a minimum spanning forest -- Efficient parallel algorithms for planar st-graphs -- Peg-solitaire, string rewriting systems and finite automata -- On the size of probabilistic formulae -- Homophonic coding with logarithmic memory size -- Complexity and modeling aspects of mesh refinement into quadrilaterals -- Topology oriented vs. exact arithmetic — Experience in implementing the three-dimensional convex hull algorithm -- The complexity of learning branches and strategies from queries -- Singularities make spatial join scheduling hard -- A faster one-dimensional topological compaction algorithm -- Algorithms for finding optimal disjoint paths around a rectangle -- An algorithm for finding a region with the minimum total L 1 from prescribed terminals -- On defect sets in bipartite graphs (extended abstract) -- Dynamic programming on distance-hereditary graphs -- On the equivalence in complexity among basic problems on bipartite and parity graphs -- All-cavity maximum matchings -- Fast algorithms for computing ?-Skeletons and their relatives -- A branch-and-cut approach for minimum weight triangulation -- An efficient approximation scheme for the subset-sum problem -- Competitive call control in mobile networks -- Generalized swap-with-parent schemes for self-organizing sequential linear lists. |
| Record Nr. | UNISA-996466078903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||