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.
Algorithmic aspects in information and management : third international conference, AAIM 2007, Portland, or, USA, June 6-8, 2007, proceedings / / Ming-Yang Kao, Xiang-Yang Li, editors
| Algorithmic aspects in information and management : third international conference, AAIM 2007, Portland, or, USA, June 6-8, 2007, proceedings / / Ming-Yang Kao, Xiang-Yang Li, editors |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] |
| Descrizione fisica | 1 online resource (438 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer algorithms
Management science - Mathematical models |
| ISBN |
1-280-94435-8
9786610944354 3-540-72870-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Papers To AAIM 2007 -- Solving Generalized Maximum Dispersion with Linear Programming -- Significance-Driven Graph Clustering -- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs -- Digraph Strong Searching: Monotonicity and Complexity -- Algorithms for Counting 2-Sat Solutions and Colorings with Applications -- Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation -- A Compact Encoding of Rectangular Drawings with Efficient Query Supports -- A New Efficient Algorithm for Computing the Longest Common Subsequence -- Scheduling a Flexible Batching Machine -- Global Search Method for Parallel Machine Scheduling -- Releasing and Scheduling of Lots in a Wafer Fab -- Mixed Criteria Packet Scheduling -- Efficient Algorithms for k-Disjoint Paths Problems on DAGs -- Acyclic Edge Colouring of Outerplanar Graphs -- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract) -- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree -- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths -- Online OVSF Code Assignment with Resource Augmentation -- Optimal Joint Rate and Power Allocation in CDMA Networks -- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers -- How to Play the Majority Game with Liars -- On Satisfiability Games and the Power of Congestion Games -- The Complexity of Algorithms Computing Game Trees on Random Assignments -- An Efficient, and Fast Convergent Algorithm for Barrier Options -- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options -- Optimal Order Allocation with Discount Pricing -- Convex Hulls of Point-Sets and Non-uniform Hypergraphs -- Optimal st-Orientations for Plane Triangulations -- Minimum Spanning Tree with Neighborhoods -- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem -- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs -- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps -- Strip Packing vs. Bin Packing -- Probe Matrix Problems: Totally Balanced Matrices -- Efficiency of Data Distribution in BitTorrent-Like Systems -- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers -- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots -- A Heuristic Method for Selecting Support Features from Large Datasets -- Invited Lecture -- Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis -- Ad Auctions – Current and Future Research -- Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. |
| Record Nr. | UNINA-9910484923403321 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic aspects in information and management : third international conference, AAIM 2007, Portland, or, USA, June 6-8, 2007, proceedings / / Ming-Yang Kao, Xiang-Yang Li, editors
| Algorithmic aspects in information and management : third international conference, AAIM 2007, Portland, or, USA, June 6-8, 2007, proceedings / / Ming-Yang Kao, Xiang-Yang Li, editors |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] |
| Descrizione fisica | 1 online resource (438 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer algorithms
Management science - Mathematical models |
| ISBN |
1-280-94435-8
9786610944354 3-540-72870-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Papers To AAIM 2007 -- Solving Generalized Maximum Dispersion with Linear Programming -- Significance-Driven Graph Clustering -- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs -- Digraph Strong Searching: Monotonicity and Complexity -- Algorithms for Counting 2-Sat Solutions and Colorings with Applications -- Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation -- A Compact Encoding of Rectangular Drawings with Efficient Query Supports -- A New Efficient Algorithm for Computing the Longest Common Subsequence -- Scheduling a Flexible Batching Machine -- Global Search Method for Parallel Machine Scheduling -- Releasing and Scheduling of Lots in a Wafer Fab -- Mixed Criteria Packet Scheduling -- Efficient Algorithms for k-Disjoint Paths Problems on DAGs -- Acyclic Edge Colouring of Outerplanar Graphs -- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract) -- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree -- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths -- Online OVSF Code Assignment with Resource Augmentation -- Optimal Joint Rate and Power Allocation in CDMA Networks -- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers -- How to Play the Majority Game with Liars -- On Satisfiability Games and the Power of Congestion Games -- The Complexity of Algorithms Computing Game Trees on Random Assignments -- An Efficient, and Fast Convergent Algorithm for Barrier Options -- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options -- Optimal Order Allocation with Discount Pricing -- Convex Hulls of Point-Sets and Non-uniform Hypergraphs -- Optimal st-Orientations for Plane Triangulations -- Minimum Spanning Tree with Neighborhoods -- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem -- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs -- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps -- Strip Packing vs. Bin Packing -- Probe Matrix Problems: Totally Balanced Matrices -- Efficiency of Data Distribution in BitTorrent-Like Systems -- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers -- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots -- A Heuristic Method for Selecting Support Features from Large Datasets -- Invited Lecture -- Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis -- Ad Auctions – Current and Future Research -- Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. |
| Record Nr. | UNISA-996466272103316 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and combinatorics : 4th annual international conference, cocoon '98, taipei, taiwan, r.o.c., august 12-14, 1998 : proceedings / / edited by Wen-Lian Hsu, Ming-Yang Kao
| Computing and combinatorics : 4th annual international conference, cocoon '98, taipei, taiwan, r.o.c., august 12-14, 1998 : proceedings / / edited by Wen-Lian Hsu, Ming-Yang Kao |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (XII, 372 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Combinatorial analysis |
| ISBN | 3-540-68535-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Algorithmic Approaches to Information Retrieval and Data Mining -- Combinatorial Problems Arising in Massive Data Sets -- Estimating Parameters of Monotone Boolean Functions -- De-amortization of Algorithms -- Computational Geometry -- On Computing New Classes of Optimal Triangulations with Angular Constraints -- Maximum Weight Triangulation and Its Application on Graph Drawing -- The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries -- Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space -- Parallel Geometric Algorithms in Coarse-Grain Network Models -- Algorithms and Data Structures -- On the Bahncard Problem -- The Ultimate Strategy to Search on m Rays? -- Better Approximation of Diagonal-Flip Transformation and Rotation Transformation -- A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations -- Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT -- Algorithms for Almost-Uniform Generation with an Unbiased Binary Source -- Improved Algorithms for Chemical Threshold Testing Problems -- Min-Max-Boundary Domain Decomposition -- Computational Complexity -- On Boolean Lowness and Boolean Highness -- The Inherent Dimension of Bounded Counting Classes -- An Exact Characterization of Symmetric Functions in q AC 0[2] -- Robust Reductions -- Approaches to Effective Semi-continuity of Real Functions -- On the Power of Additive Combinatorial Search Model -- Parallel and Distributed Processing, and Switching Networks -- The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch -- Lower Bounds for Wide-Sense Non-blocking Clos Network -- Multirate Multicast Switching Networks -- Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses -- Executing Divisible Jobs on a Network with a Fixed Number of Processors -- Graph Theory -- On the Ádám Conjecture on Circulant Graphs -- Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable -- A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter -- A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree -- A Graph Optimization Problem in Virtual Colonoscopy -- Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices -- An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs -- Combinatorics and Cryptography -- Similarity in Two-Dimensional Strings -- On Multi-dimensional Hilbert Indexings -- Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth -- Eulerian Secret Key Exchange -- One-Time Tables for Two-Party Computation. |
| Record Nr. | UNISA-996466099403316 |
| Berlin, Germany : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and combinatorics : 4th annual international conference, cocoon '98, taipei, taiwan, r.o.c., august 12-14, 1998 : proceedings / / edited by Wen-Lian Hsu, Ming-Yang Kao
| Computing and combinatorics : 4th annual international conference, cocoon '98, taipei, taiwan, r.o.c., august 12-14, 1998 : proceedings / / edited by Wen-Lian Hsu, Ming-Yang Kao |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (XII, 372 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Combinatorial analysis |
| ISBN | 3-540-68535-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Algorithmic Approaches to Information Retrieval and Data Mining -- Combinatorial Problems Arising in Massive Data Sets -- Estimating Parameters of Monotone Boolean Functions -- De-amortization of Algorithms -- Computational Geometry -- On Computing New Classes of Optimal Triangulations with Angular Constraints -- Maximum Weight Triangulation and Its Application on Graph Drawing -- The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries -- Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space -- Parallel Geometric Algorithms in Coarse-Grain Network Models -- Algorithms and Data Structures -- On the Bahncard Problem -- The Ultimate Strategy to Search on m Rays? -- Better Approximation of Diagonal-Flip Transformation and Rotation Transformation -- A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations -- Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT -- Algorithms for Almost-Uniform Generation with an Unbiased Binary Source -- Improved Algorithms for Chemical Threshold Testing Problems -- Min-Max-Boundary Domain Decomposition -- Computational Complexity -- On Boolean Lowness and Boolean Highness -- The Inherent Dimension of Bounded Counting Classes -- An Exact Characterization of Symmetric Functions in q AC 0[2] -- Robust Reductions -- Approaches to Effective Semi-continuity of Real Functions -- On the Power of Additive Combinatorial Search Model -- Parallel and Distributed Processing, and Switching Networks -- The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch -- Lower Bounds for Wide-Sense Non-blocking Clos Network -- Multirate Multicast Switching Networks -- Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses -- Executing Divisible Jobs on a Network with a Fixed Number of Processors -- Graph Theory -- On the Ádám Conjecture on Circulant Graphs -- Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable -- A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter -- A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree -- A Graph Optimization Problem in Virtual Colonoscopy -- Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices -- An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs -- Combinatorics and Cryptography -- Similarity in Two-Dimensional Strings -- On Multi-dimensional Hilbert Indexings -- Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth -- Eulerian Secret Key Exchange -- One-Time Tables for Two-Party Computation. |
| Record Nr. | UNINA-9910143474203321 |
| Berlin, Germany : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Encyclopedia of Algorithms [[electronic resource] /] / edited by Ming-Yang Kao
| Encyclopedia of Algorithms [[electronic resource] /] / edited by Ming-Yang Kao |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (LIV, 1166 p. 183 illus.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computers
Electrical engineering Applied mathematics Engineering mathematics Artificial intelligence Computer mathematics Theory of Computation Electrical Engineering Applications of Mathematics Artificial Intelligence Computational Mathematics and Numerical Analysis |
| ISBN | 3-642-27848-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | VLSI -- Distributed Computing -- Parallel Processing -- Automated Design -- Robotics -- Graphics -- Data Base Design -- Software Tools -- Sorting -- Searching -- Data Structures -- Computational Geometry -- Linear Programming. |
| Record Nr. | UNINA-9910349316403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Encyclopedia of Algorithms [[electronic resource] /] / edited by Ming-Yang Kao
| Encyclopedia of Algorithms [[electronic resource] /] / edited by Ming-Yang Kao |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (LIV, 1166 p. 183 illus.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computers
Electrical engineering Applied mathematics Engineering mathematics Artificial intelligence Computer mathematics Theory of Computation Electrical Engineering Applications of Mathematics Artificial Intelligence Computational Mathematics and Numerical Analysis |
| ISBN | 3-642-27848-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | VLSI -- Distributed Computing -- Parallel Processing -- Automated Design -- Robotics -- Graphics -- Data Base Design -- Software Tools -- Sorting -- Searching -- Data Structures -- Computational Geometry -- Linear Programming. |
| Record Nr. | UNISA-996465348303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Encyclopedia of algorithms / / Ming-Yang Kao, editor
| Encyclopedia of algorithms / / Ming-Yang Kao, editor |
| Edizione | [2nd ed. 2016.] |
| Pubbl/distr/stampa | New York : , : Springer, , [2016] |
| Descrizione fisica | 1 online resource (379 illus., 116 illus. in color. eReference.) |
| Disciplina | 518.1 |
| Collana | Springer reference |
| Soggetto topico | Algorithms |
| ISBN | 1-4939-2864-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | From the contents: Abelian Hidden Subgroup Problem -- Abstract Voronoi Diagrams -- Active Learning - Modern Learning Theory -- Backdoors to SAT -- Backtracking Based k-SAT Algorithms -- Bargaining Networks -- Cache-Oblivious B-Tree -- Canonical Orders and Schnyder Realizers -- Circuit Placement.-Data Migration -- Decoding Reed–Solomon Codes -- Direct Routing Algorithms -- Edit Distance Under Block Operations -- Engineering Geometric Algorithms -- Enumeration of Non-crossing Geometric Graphs -- Facility Location -- Flow Time Minimization -- Force-Directed Graph Drawing -- Gate Sizing -- General Equilibrium -- Geographic Routing -- Hamilton Cycles in Random Intersection Graphs -- Hardness of Proper Learning -- Huffman Coding -- Implementation Challenge for Shortest Paths -- Incentive Compatible Selection -- Inductive Inference -- Kernelization, Bidimensionality and Kernels -- Kinetic Data Structures -- Knowledge in Distributed Systems -- Large-Treewidth Graph Decompositions -- Layout Decomposition for Multiple Patterning -- Learning Automata -- Majority Equilibrium -- Manifold Reconstruction -- Market Games and Content Distribution -- Nash Equilibria and Dominant Strategies in Routing -- Nearest Neighbor Interchange and Related Distances -- Negative Cycles in Weighted Digraphs -- Oblivious Routing -- Online Interval Coloring -- Online Paging and Caching -- PAC Learning -- Parity Games -- Permutation Enumeration -- Quadtrees and Morton Indexing -- Quantum Algorithm for Factoring -- Quantum Dense Coding -- Radiocoloring in Planar Graphs -- Random Planted 3-SAT -- Randomization in Distributed Computing -- Schedulers for Optimistic Rate Based Flow Control -- Secretary Problems and Online Auctions -- Separators in Graphs -- Table Compression -- Text Indexing -- Triangulation Data Structures -- Unified View of Graph Searching and LDFS-Based Certifying Algorithms -- Universal Sequencing on an Unreliable Machine -- Upward Graph Drawing -- Vector Bin Packing -- Vector Scheduling Problems -- Voltage Scheduling -- Wavelet Trees -- Well Separated Pair Decomposition -- Wire Sizing. . |
| Record Nr. | UNINA-9910254988403321 |
| New York : , : Springer, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Encyclopedia of algorithms / / Ming-Yang Kao, editor
| Encyclopedia of algorithms / / Ming-Yang Kao, editor |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | New York, N.Y. : , : Springer, , 2008 |
| Descrizione fisica | 1 online resource (liii, 1166 pages) : illustrations |
| Disciplina | 518.103 |
| Collana | Springer reference |
| Soggetto topico |
Algorithms
Arithmetic - Foundations |
| ISBN | 0-387-30162-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | VLSI -- Distributed Computing -- Parallel Processing -- Automated Design -- Robotics -- Graphics -- Data Base Design -- Software Tools -- Sorting -- Searching -- Data Structures -- Computational Geometry -- Linear Programming. |
| Record Nr. | UNINA-9910146293903321 |
| New York, N.Y. : , : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||