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.
Frontiers in Algorithmics [[electronic resource] ] : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang
| Frontiers in Algorithmics [[electronic resource] ] : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 344 p. 107 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Discrete Mathematics in Computer Science |
| ISBN | 3-319-08016-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Research on algorithms -- Discrete structures -- Operations research -- Combinatorial optimization.- Applications. |
| Record Nr. | UNISA-996217777503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang
| Frontiers in Algorithmics : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 344 p. 107 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Discrete Mathematics in Computer Science |
| ISBN | 3-319-08016-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Research on algorithms -- Discrete structures -- Operations research -- Combinatorial optimization.- Applications. |
| Record Nr. | UNINA-9910483147303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics [[electronic resource] ] : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings / / edited by Xiaotie Deng, John E. Hopcroft, Jinyun Xue
| Frontiers in Algorithmics [[electronic resource] ] : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings / / edited by Xiaotie Deng, John E. Hopcroft, Jinyun Xue |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIV, 372 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Computer science—Mathematics Artificial intelligence Algorithms Discrete mathematics Software engineering Data Science Mathematics of Computing Artificial Intelligence Discrete Mathematics in Computer Science Software Engineering |
| ISBN |
1-280-38299-6
9786613560902 3-642-02270-7 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FAW 2009 -- Study on Parallel Computing -- Communication Complexity and Its Applications -- Algorithmic Problems in Computer and Network Power Management -- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains -- Edge Search Number of Cographs in Linear Time -- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems -- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs -- Covering-Based Routing Algorithms for Cyclic Content-Based P/S System -- On the ?-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games -- Cop-Robber Guarding Game with Cycle Robber Region -- Covered Interest Arbitrage in Exchange Rate Forecasting Markets -- CFI Construction and Balanced Graphs -- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions -- Space–Query-Time Tradeoff for Computing the Visibility Polygon -- Square and Rectangle Covering with Outliers -- Processing an Offline Insertion-Query Sequence with Applications -- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs -- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs -- On Modulo Linked Graphs -- Pathwidth is NP-Hard for Weighted Trees -- A Max-Margin Learning Algorithm with Additional Features -- DDoS Attack Detection Algorithm Using IP Address Features -- Learning with Sequential Minimal Transductive Support Vector Machine -- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams -- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set -- Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks -- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems -- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning -- Approximating Scheduling Machines with Capacity Constraints -- Approximating the Spanning k-Tree Forest Problem -- Toward an Automatic Approach to Greedy Algorithms -- A Novel Approximate Algorithm for Admission Control -- On the Structure of Consistent Partitions of Substring Set of a Word -- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet -- An Improved Database Classification Algorithm for Multi-database Mining -- Six-Card Secure AND and Four-Card Secure XOR. |
| Record Nr. | UNISA-996465421903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in algorithmics : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009 : proceedings / / Xiaotie Deng, John E. Hopcroft, Jinyun Xue (eds.)
| Frontiers in algorithmics : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009 : proceedings / / Xiaotie Deng, John E. Hopcroft, Jinyun Xue (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XIV, 372 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
DengXiaotie
HopcroftJohn E. <1939-> XueJinyun |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Algorithms
Computer algorithms |
| ISBN |
1-280-38299-6
9786613560902 3-642-02270-7 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | FAW 2009 -- Study on Parallel Computing -- Communication Complexity and Its Applications -- Algorithmic Problems in Computer and Network Power Management -- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains -- Edge Search Number of Cographs in Linear Time -- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems -- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs -- Covering-Based Routing Algorithms for Cyclic Content-Based P/S System -- On the ?-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games -- Cop-Robber Guarding Game with Cycle Robber Region -- Covered Interest Arbitrage in Exchange Rate Forecasting Markets -- CFI Construction and Balanced Graphs -- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions -- Space–Query-Time Tradeoff for Computing the Visibility Polygon -- Square and Rectangle Covering with Outliers -- Processing an Offline Insertion-Query Sequence with Applications -- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs -- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs -- On Modulo Linked Graphs -- Pathwidth is NP-Hard for Weighted Trees -- A Max-Margin Learning Algorithm with Additional Features -- DDoS Attack Detection Algorithm Using IP Address Features -- Learning with Sequential Minimal Transductive Support Vector Machine -- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams -- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set -- Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks -- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems -- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning -- Approximating Scheduling Machines with Capacity Constraints -- Approximating the Spanning k-Tree Forest Problem -- Toward an Automatic Approach to Greedy Algorithms -- A Novel Approximate Algorithm for Admission Control -- On the Structure of Consistent Partitions of Substring Set of a Word -- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet -- An Improved Database Classification Algorithm for Multi-database Mining -- Six-Card Secure AND and Four-Card Secure XOR. |
| Record Nr. | UNINA-9910483641603321 |
| Berlin ; ; New York, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Studies in abstract families of languages / / by Seymour Ginsburg, Sheila Greibach, John Hopcroft
| Studies in abstract families of languages / / by Seymour Ginsburg, Sheila Greibach, John Hopcroft |
| Autore | Ginsburg Seymour <1927-> |
| Pubbl/distr/stampa | Providence : , : American Mathematical Society, , 1969 |
| Descrizione fisica | 1 online resource (58 p.) |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Machine theory
Computer programming Robots |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-4704-0036-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ""Contents""; ""Abstract families of languages""; ""Independence of AFL operations""; ""Pre-AFL"" |
| Record Nr. | UNINA-9910480766103321 |
Ginsburg Seymour <1927->
|
||
| Providence : , : American Mathematical Society, , 1969 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Studies in abstract families of languages / / by Seymour Ginsburg, Sheila Greibach, John Hopcroft
| Studies in abstract families of languages / / by Seymour Ginsburg, Sheila Greibach, John Hopcroft |
| Autore | Ginsburg Seymour <1927-> |
| Pubbl/distr/stampa | Providence : , : American Mathematical Society, , 1969 |
| Descrizione fisica | 1 online resource (58 p.) |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Machine theory
Computer programming Robots |
| ISBN | 1-4704-0036-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ""Contents""; ""Abstract families of languages""; ""Independence of AFL operations""; ""Pre-AFL"" |
| Record Nr. | UNINA-9910788604403321 |
|
Ginsburg Seymour <1927->
|
||
| Providence : , : American Mathematical Society, , 1969 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Studies in abstract families of languages / / by Seymour Ginsburg, Sheila Greibach, John Hopcroft
| Studies in abstract families of languages / / by Seymour Ginsburg, Sheila Greibach, John Hopcroft |
| Autore | Ginsburg Seymour <1927-> |
| Pubbl/distr/stampa | Providence : , : American Mathematical Society, , 1969 |
| Descrizione fisica | 1 online resource (58 p.) |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Machine theory
Computer programming Robots |
| ISBN | 1-4704-0036-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ""Contents""; ""Abstract families of languages""; ""Independence of AFL operations""; ""Pre-AFL"" |
| Record Nr. | UNINA-9910817214903321 |
|
Ginsburg Seymour <1927->
|
||
| Providence : , : American Mathematical Society, , 1969 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||