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 and Models for the Web-Graph [[electronic resource] ] : Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings / / edited by Stefano Leonardi
| Algorithms and Models for the Web-Graph [[electronic resource] ] : Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings / / edited by Stefano Leonardi |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (IX, 191 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Algorithms Computer science—Mathematics Application software Information storage and retrieval Theory of Computation Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Information Systems Applications (incl. Internet) Information Storage and Retrieval |
| ISBN | 3-540-30216-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | IBM Invited Lecture -- The Phase Transition and Connectedness in Uniformly Grown Random Graphs -- Contributed Papers -- Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract) -- Dominating Sets in Web Graphs -- A Geometric Preferential Attachment Model of Networks -- Traffic-Driven Model of the World Wide Web Graph -- On Reshaping of Clustering Coefficients in Degree-Based Topology Generators -- Generating Web Graphs with Embedded Communities -- Making Eigenvector-Based Reputation Systems Robust to Collusion -- Towards Scaling Fully Personalized PageRank -- Fast PageRank Computation Via a Sparse Linear System (Extended Abstract) -- T-Rank: Time-Aware Authority Ranking -- Links in Hierarchical Information Networks -- Crawling the Infinite Web: Five Levels Are Enough -- Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations -- Communities Detection in Large Networks. |
| Record Nr. | UNISA-996465759703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Models for the Web-Graph : Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings / / edited by Stefano Leonardi
| Algorithms and Models for the Web-Graph : Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings / / edited by Stefano Leonardi |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (IX, 191 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Algorithms Computer science—Mathematics Application software Information storage and retrieval Theory of Computation Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Information Systems Applications (incl. Internet) Information Storage and Retrieval |
| ISBN | 3-540-30216-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | IBM Invited Lecture -- The Phase Transition and Connectedness in Uniformly Grown Random Graphs -- Contributed Papers -- Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract) -- Dominating Sets in Web Graphs -- A Geometric Preferential Attachment Model of Networks -- Traffic-Driven Model of the World Wide Web Graph -- On Reshaping of Clustering Coefficients in Degree-Based Topology Generators -- Generating Web Graphs with Embedded Communities -- Making Eigenvector-Based Reputation Systems Robust to Collusion -- Towards Scaling Fully Personalized PageRank -- Fast PageRank Computation Via a Sparse Linear System (Extended Abstract) -- T-Rank: Time-Aware Authority Ranking -- Links in Hierarchical Information Networks -- Crawling the Infinite Web: Five Levels Are Enough -- Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations -- Communities Detection in Large Networks. |
| Record Nr. | UNINA-9910767535503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms – ESA 2005 [[electronic resource] ] : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi
| Algorithms – ESA 2005 [[electronic resource] ] : 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings / / edited by Gerth S. Brodal, Stefano Leonardi |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVIII, 901 p.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer networks Artificial intelligence—Data processing Numerical analysis Computer science—Mathematics Discrete mathematics Programming Techniques Computer Communication Networks Data Science Numerical Analysis Discrete Mathematics in Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Designing Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations -- Convex Hull and Voronoi Diagram of Additively Weighted Points -- New Tools and Simpler Algorithms for Branchwidth -- Treewidth Lower Bounds with Brambles -- Minimal Interval Completions -- A 2-Approximation Algorithm for Sorting by Prefix Reversals -- Approximating the 2-Interval Pattern Problem -- A Loopless Gray Code for Minimal Signed-Binary Representations -- Efficient Approximation Schemes for Geometric Problems? -- Geometric Clustering to Minimize the Sum of Cluster Sizes -- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs -- Packet Routing and Information Gathering in Lines, Rings and Trees -- Jitter Regulation for Multiple Streams -- Efficient c-Oriented Range Searching with DOP-Trees -- Matching Point Sets with Respect to the Earth Mover’s Distance -- Small Stretch Spanners on Dynamic Graphs -- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure -- Experimental Study of Geometric t-Spanners -- Highway Hierarchies Hasten Exact Shortest Path Queries -- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays -- Fairness-Free Periodic Scheduling with Vacations -- Online Bin Packing with Cardinality Constraints -- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines -- Engineering Planar Separator Algorithms -- Stxxl: Standard Template Library for XXL Data Sets -- Negative Cycle Detection Problem -- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees -- Online View Maintenance Under a Response-Time Constraint -- Online Primal-Dual Algorithms for Covering and Packing Problems -- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information -- Using Fractional Primal-Dual to Schedule Split Intervals with Demands -- An Approximation Algorithm for the Minimum Latency Set Cover Problem -- Workload-Optimal Histograms on Streams -- Finding Frequent Patterns in a String in Sublinear Time -- Online Occlusion Culling -- Shortest Paths in Matrix Multiplication Time -- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs -- Greedy Routing in Tree-Decomposed Graphs -- Making Chord Robust to Byzantine Attacks -- Bucket Game with Applications to Set Multicover and Dynamic Page Migration -- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model -- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs -- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem -- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack -- Robust Approximate Zeros -- Optimizing a 2D Function Satisfying Unimodality Properties. |
| Record Nr. | UNISA-996465865103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani
| Approximation Algorithms for Combinatorial Optimization [[electronic resource] ] : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 276 p.) |
| Disciplina | 004/.01/51 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Mathematical optimization Algorithms Computer science—Mathematics Numerical analysis Programming Techniques Theory of Computation Optimization Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing |
| ISBN | 3-540-45753-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Search and Classification of High Dimensional Data -- Bicriteria Spanning Tree Problems -- Improved Approximation Algorithms for Multilevel Facility Location Problems -- On Constrained Hypergraph Coloring and Scheduling -- On the Power of Priority Algorithms for Facility Location and Set Cover -- Two Approximation Algorithms for 3-Cycle Covers -- Approximation Algorithms for the Unsplittable Flow Problem -- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor -- Typical Rounding Problems -- Approximating Min-sum Set Cover -- Approximating Maximum Edge Coloring in Multigraphs -- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees -- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs -- Facility Location and the Geometric Minimum-Diameter Spanning Tree -- Improved Approximation Algorithms for the Partial Vertex Cover Problem -- Minimum Restricted Diameter Spanning Trees -- Hardness of Approximation for Vertex-Connectivity Network-Design Problems -- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem -- Routing and Admission Control in Networks with Advance Reservations -- Improved Approximation Algorithms for Metric Facility Location Problems -- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products -- Primal-Dual Algorithms for Connected Facility Location Problems. |
| Record Nr. | UNISA-996465517903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani
| Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings / / edited by Klaus Jansen, Stefano Leonardi, Vijay Vazirani |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 276 p.) |
| Disciplina | 004/.01/51 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computer science Mathematical optimization Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Programming Techniques Theory of Computation Optimization Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-540-45753-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Search and Classification of High Dimensional Data -- Bicriteria Spanning Tree Problems -- Improved Approximation Algorithms for Multilevel Facility Location Problems -- On Constrained Hypergraph Coloring and Scheduling -- On the Power of Priority Algorithms for Facility Location and Set Cover -- Two Approximation Algorithms for 3-Cycle Covers -- Approximation Algorithms for the Unsplittable Flow Problem -- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor -- Typical Rounding Problems -- Approximating Min-sum Set Cover -- Approximating Maximum Edge Coloring in Multigraphs -- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees -- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs -- Facility Location and the Geometric Minimum-Diameter Spanning Tree -- Improved Approximation Algorithms for the Partial Vertex Cover Problem -- Minimum Restricted Diameter Spanning Trees -- Hardness of Approximation for Vertex-Connectivity Network-Design Problems -- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem -- Routing and Admission Control in Networks with Advance Reservations -- Improved Approximation Algorithms for Metric Facility Location Problems -- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products -- Primal-Dual Algorithms for Connected Facility Location Problems. |
| Record Nr. | UNINA-9910143893203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Internet and Network Economics [[electronic resource] ] : 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009, Proceedings / / edited by Stefano Leonardi
| Internet and Network Economics [[electronic resource] ] : 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009, Proceedings / / edited by Stefano Leonardi |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 642 p.) |
| Disciplina | 004n/a |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Information storage and retrieval
Discrete mathematics Public administration Application software Computers and civilization Information Storage and Retrieval Discrete Mathematics Public Administration Information Systems Applications (incl. Internet) Computers and Society Computer Appl. in Administrative Data Processing |
| ISBN |
1-280-38338-0
9786613561305 3-642-10841-5 |
| Classificazione | 85.20 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Ad Exchanges: Research Issues -- Adaptive Learning in Systems of Interacting Agents -- Quantifying Outcomes in Games -- Regular Papers -- Competitive Routing over Time -- On 2-Player Randomized Mechanisms for Scheduling -- On Stackelberg Pricing with Computationally Bounded Consumers -- On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays -- Parametric Packing of Selfish Items and the Subset Sum Algorithm -- An Online Multi-unit Auction with Improved Competitive Ratio -- Prediction Mechanisms That Do Not Incentivize Undesirable Actions -- Pricing Strategies for Viral Marketing on Social Networks -- Consistent Continuous Trust-Based Recommendation Systems -- The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs -- Tighter Bounds for Facility Games -- Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols -- Approximate Pure Nash Equilibria via Lovász Local Lemma -- Externalities in Keyword Auctions: An Empirical and Theoretical Assessment -- Covering Games: Approximation through Non-cooperation -- Contract Auctions for Sponsored Search -- Bidding for Representative Allocations for Display Advertising -- Social Networks and Stable Matchings in the Job Market -- Maximizing the Minimum Load: The Cost of Selfishness -- Competitive Repeated Allocation without Payments -- Pseudonyms in Cost-Sharing Games -- Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies -- Nash Equilibria for Voronoi Games on Transitive Graphs -- Selfish Scheduling with Setup Times -- Computational Aspects of Multimarket Price Wars -- The Impact of Social Ignorance on Weighted Congestion Games -- The Complexity of Models of International Trade -- The Geometry of Truthfulness -- Optimal Incentives for Participation with Type-Dependent Externalities -- Nash Dynamics in Congestion Games with Similar Resources -- Online Ad Assignment with Free Disposal -- Truthful and Quality Conscious Query Incentive Networks -- An Analysis of Troubled Assets Reverse Auction -- Direction Preserving Zero Point Computing and Applications -- Short Papers -- Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models -- Route Distribution Incentives -- Wiretapping a Hidden Network -- Refining the Cost of Cheap Labor in Set System Auctions -- On the Power of Mediators -- Strong Nash Equilibria in Games with the Lexicographical Improvement Property -- A Note on Strictly Competitive Games -- The Efficiency of Fair Division -- Sequential Bidding in the Bailey-Cavallo Mechanism -- Subsidized Prediction Markets for Risk Averse Traders -- Envy, Multi Envy, and Revenue Maximization -- Nudging Mechanisms for Technology Adoption -- Mechanism Design for Complexity-Constrained Bidders -- Priority Right Auction for Komi Setting -- Randomized Online Algorithms for the Buyback Problem -- Envy-Free Allocations for Budgeted Bidders -- On the Inefficiency Ratio of Stable Equilibria in Congestion Games -- Betting on the Real Line -- Characterization of Strategy-Proof, Revenue Monotone Combinatorial Auction Mechanisms and Connection with False-Name-Proofness -- 2D-TUCKER Is PPAD-Complete -- Bidder Optimal Assignments for General Utilities -- A New Ranking Scheme of the GSP Mechanism with Markovian Users -- Mediated Equilibria in Load-Balancing Games -- On the Impact of Strategy and Utility Structures on Congestion-Averse Games -- On Strong Equilibria in the Max Cut Game -- Stability and Convergence in Selfish Scheduling with Altruistic Agents -- Gaming Dynamic Parimutuel Markets -- News Posting by Strategic Users in a Social Network -- Erratum -- Erratum to: Prediction Mechanisms That Do Not Incentivize Undesirable Actions. |
| Record Nr. | UNISA-996465918503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Self-star Properties in Complex Information Systems [[electronic resource] ] : Conceptual and Practical Foundations / / edited by Ozalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad van Moorsel, Maarten van Steen
| Self-star Properties in Complex Information Systems [[electronic resource] ] : Conceptual and Practical Foundations / / edited by Ozalp Babaoglu, Márk Jelasity, Alberto Montresor, Christof Fetzer, Stefano Leonardi, Aad van Moorsel, Maarten van Steen |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (IX, 447 p.) |
| Disciplina | 003 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer networks
Software engineering Computer science Algorithms Artificial intelligence Application software Computer Communication Networks Software Engineering Theory of Computation Artificial Intelligence Computer and Information Systems Applications |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Self-Star Vision -- The Self-Star Vision -- Self-organization -- Evolving Fractal Gene Regulatory Networks for Graceful Degradation of Software -- Evolutionary Computing and Autonomic Computing: Shared Problems, Shared Solutions? -- Self-? Topology Control in Wireless Multihop Ad Hoc Communication Networks -- Emergent Consensus in Decentralised Systems Using Collaborative Reinforcement Learning -- The Biologically Inspired Distributed File System: An Emergent Thinker Instantiation -- Evolutionary Games: An Algorithmic View -- Self-awareness -- Model Based Diagnosis and Contexts in Self Adaptive Software -- On the Use of Online Analytic Performance Models, in Self-Managing and Self-Organizing Computer Systems -- Prediction-Based Software Availability Enhancement -- Making Self-Adaptation an Engineering Reality -- An Online Control Framework for Designing Self-Optimizing Computing Systems: Application to Power Management -- Self-Management of Systems Through Automatic Restart -- Fundamentals of Dynamic Decentralized Optimization in Autonomic Computing Systems -- Self-awareness vs. Self-organization -- The Conflict Between Self-* Capabilities and Predictability -- Self-Aware Software – Will It Become a Reality? -- Supporting Self-* -- A Case for Design Methodology Research in Self-* Distributed Systems -- Enabling Autonomic Grid Applications: Requirements, Models and Infrastructure -- Pandora: An Efficient Platform for the Construction of Autonomic Applications -- Spatial Computing: The TOTA Approach -- Towards Self-Managing QoS-Enabled Peer-to-Peer Systems -- Peer-to-Peer Algorithms -- Cooperative Content Distribution: Scalability Through Self-Organization -- Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks -- Multifaceted Simultaneous Load Balancing in DHT-Based P2P Systems: A New Game with Old Balls and Bins -- Robust Locality-Aware Lookup Networks -- Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks -- Self-Management of Virtual Paths in Dynamic Networks -- Sociologically Inspired Approaches for Self-*: Examples and Prospects. |
| Record Nr. | UNISA-996465972403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WWW '15 Companion : Proceedings of the 24th International Conference on World Wide Web / / Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi
| WWW '15 Companion : Proceedings of the 24th International Conference on World Wide Web / / Aldo Gangemi, Stefano Leonardi, Alessandro Panconesi |
| Autore | Gangemi Aldo |
| Pubbl/distr/stampa | Republic and Canton of Geneva : , : ACM, , 2015 |
| Descrizione fisica | 1 online resource (1562 pages) |
| Disciplina | 004 |
| Soggetto topico |
Computer science
Electronic data processing |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910490050003321 |
Gangemi Aldo
|
||
| Republic and Canton of Geneva : , : ACM, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||