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.
Control theoretic splines : optimal control, statistics, and path planning / Magnus Egerstedt and Clyde Martin
| Control theoretic splines : optimal control, statistics, and path planning / Magnus Egerstedt and Clyde Martin |
| Autore | Egerstedt, Magnus |
| Pubbl/distr/stampa | Princeton, : Princeton university press, 2010 |
| Descrizione fisica | X, 217 p. ; 25 cm. |
| Disciplina |
511
511.422 |
| Altri autori (Persone) | Martin, Clyde F. |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Interpolazione |
| ISBN | 9780691132969 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-USM1898775 |
Egerstedt, Magnus
|
||
| Princeton, : Princeton university press, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Convegno su rapporti tra ricerca matematica pura e matematica applicta
| Convegno su rapporti tra ricerca matematica pura e matematica applicta |
| Autore | Rapporti tra ricerca matematica pura e matematica applicata : <27-29 settembre 1973 |
| Pubbl/distr/stampa | Bologna : Officine Grafiche Pitagora, 1973 |
| Descrizione fisica | 2 v. ; 24 cm |
| Disciplina | 511 |
| Soggetto topico | Matematica |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Nota di contenuto |
< |
| Record Nr. | UNISA-990003219130203316 |
|
Rapporti tra ricerca matematica pura e matematica applicata : <27-29 settembre 1973
|
||
| Bologna : Officine Grafiche Pitagora, 1973 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cours de calcul mathématique modern : La pratique des mathématique modernes a l'usage des ingénieurs / M. Laboureur, Chossat M et Cardot C.
| Cours de calcul mathématique modern : La pratique des mathématique modernes a l'usage des ingénieurs / M. Laboureur, Chossat M et Cardot C. |
| Autore | LABOUREUR, M. |
| Pubbl/distr/stampa | Paris : Dunod, 1967-1968 |
| Descrizione fisica | 2v. : ill. ; 24 cm |
| Disciplina | 511 |
| Altri autori (Persone) |
CHOSSAT, M.
CARDOT, C. |
| Soggetto topico | Matematica |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Nota di contenuto |
< |
| Record Nr. | UNISA-990000247730203316 |
|
LABOUREUR, M.
|
||
| Paris : Dunod, 1967-1968 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cryptography and Coding : based on the proceedings of a conference organized by the Institute of Mathematics and its Applications on Cryptography and Coding, held at the Royal Agricultural College , : Cirencester on 15th-17th december 1986 / edited by Henry J. Beker , F.C. Piper
| Cryptography and Coding : based on the proceedings of a conference organized by the Institute of Mathematics and its Applications on Cryptography and Coding, held at the Royal Agricultural College , : Cirencester on 15th-17th december 1986 / edited by Henry J. Beker , F.C. Piper |
| Autore | CONFERENCE ON CRYPTOGRAPHY AND CODING |
| Pubbl/distr/stampa | Oxford : Clarendon Press, 1989 |
| Descrizione fisica | x, 297 p. ; 24 cm |
| Disciplina | 511 |
| Collana | Conference series |
| Soggetto non controllato |
Teoria dei grafi
Combinatorica |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990002554950403321 |
|
CONFERENCE ON CRYPTOGRAPHY AND CODING
|
||
| Oxford : Clarendon Press, 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Decision Tables : Theory and Practice / Solomon L. Pollack , Harry T. Hicks Jr. , William J. Harrison
| Decision Tables : Theory and Practice / Solomon L. Pollack , Harry T. Hicks Jr. , William J. Harrison |
| Autore | Pollack, Solomom L. |
| Pubbl/distr/stampa | New York : John Wiley, 1971 |
| Descrizione fisica | xii, 179 p. ; 26 cm |
| Disciplina | 511 |
| Soggetto non controllato | Manuali e tavole di matematica |
| ISBN | 047169150X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990002559700403321 |
|
Pollack, Solomom L.
|
||
| New York : John Wiley, 1971 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Design theory / Thomas Beth, Dieter Jungnickel, Hanfried Lenz
| Design theory / Thomas Beth, Dieter Jungnickel, Hanfried Lenz |
| Autore | Beth, Thomas <1949- > |
| Edizione | [2. ed] |
| Pubbl/distr/stampa | Cambridge, : Cambridge University Press, c1999 |
| Descrizione fisica | 2 v. ; 25 cm. |
| Disciplina |
511
511.6 |
| Altri autori (Persone) |
Jungnickel, Dieter <1952- >
Lenz, Hanfried |
| Soggetto topico | Analisi combinatoria |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-PUV0478951 |
|
Beth, Thomas <1949- >
|
||
| Cambridge, : Cambridge University Press, c1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Die praxis der methode der kleinsten quadrate fur die bedurfnisse der anfanger / bearbeitet von W. v. Freeden
| Die praxis der methode der kleinsten quadrate fur die bedurfnisse der anfanger / bearbeitet von W. v. Freeden |
| Autore | Freeden, Wilhelm Ihno Adolph : von |
| Pubbl/distr/stampa | Braunschweig : Druck und Verlag von f. Vieweg un sohn, 1861-1863 |
| Descrizione fisica | v. ; 23 cm |
| Disciplina |
511
519.4 |
| Soggetto non controllato | Metodo dei minimi quadrati |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ger |
| Record Nr. | UNINA-990001177130403321 |
|
Freeden, Wilhelm Ihno Adolph : von
|
||
| Braunschweig : Druck und Verlag von f. Vieweg un sohn, 1861-1863 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Digraphs : theory and techniques / By D.F. Robinson and L.R. Foulds.
| Digraphs : theory and techniques / By D.F. Robinson and L.R. Foulds. |
| Autore | Robinson, David Foster |
| Pubbl/distr/stampa | New York : Gordon and Breach Science Publishers, 1980 |
| Descrizione fisica | XV,256 p., ill., 24 cm |
| Disciplina | 511 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNINA-990000277510403321 |
|
Robinson, David Foster
|
||
| New York : Gordon and Breach Science Publishers, 1980 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete algorithms and complexity : proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan / / edited by David S. Johnson [and three others]
| Discrete algorithms and complexity : proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan / / edited by David S. Johnson [and three others] |
| Pubbl/distr/stampa | Orlando, Florida ; ; London, England : , : Academic Press, Inc., , 1987 |
| Descrizione fisica | 1 online resource (497 p.) |
| Disciplina | 511 |
| Collana | Perspectives in Computing |
| Soggetto topico |
Computer programming
Computer algorithms Computational complexity |
| ISBN | 1-4832-7400-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Discrete Algorithms and Complexity; Copyright Page; Table of Contents; Contributors; Foreword; Chapter 1. An Upper Bound on the Expected Cost of an Optimal Assignment; Introduction; A Regularity Condition; The Transportation Problem and its Dual; Acknowledgement; References; Chapter 2. The Principal Partition of Vertex-Weighted Graphs and Its Applications; 1. Introduction; 2. The Principal Partition of Vertex-Weighted Graphs and Solution Algorithms For Problem 2; 3. Flow Assignment In The Graph Defined For Problem 4: Part 1
4. Flow Assignment In The Graph Defined For Problem 4: Part25. Applications; 6. Concluding Remarks; References; Chapter 3. Generalized Colorings; 0. Introduction; 1. Parameters; 2. Algorithmic Issues; 3. Obstructions; 4. The Homomorphism Order; REFERENCES; Chapter 4. Voronoi Diagram for Points in a Simple Polygon; 1. Introduction; 2. Sketch of the algorithm; 3. Constructing the weighted Voronoi diagram; References; Chapter 5. Computing the Geodesic Center of aSimple Polygon; 1. Introduction; 2. Uniqueness of Geodesic Center; 3. Geodesic Diameter of a Simple Polygon 4. Farthest-Point Voronoi DiagraReferences; Chapter 6. On deleting vertices to make a graph of positive genus planar; 1. Introduction; 2. Background in topologioal graph theory and order arithmetic; 3. The main result; 4. Conclusion; References; Chapter 7. Algorithms for Routing around a Rectangle; 1. Introduction; 2. Edge-disjoint paths; 3. Routing; 4. Minimum area routing; References; Chapter 8. A Remark on the Complexity of the Knapsack Problem; 1. Introduction; 2. The Basic Algorithm and a Restricted Modification; 3. The Three List Problem and its Relation to the Knapsack Problem ReferencesChapter 9. Fast, Rigorous Factorisation and Diecrete Logarltha Algoritluas; 1. Introduction; 2. A riaoroua version of the elliptic curve factorinamethod; 3. Factoring with random squares; 4. Discrete logarithes In GF(p); 5. DISCRETE LOGARITHMS OVERGF(2n); REFERENCES; Chapter 10. Redundant Coding for Local Computability; 1. Introduction; 2. Coding and Local Computability; 3. Addition on Residue Class; 4. High-speed Parallel Computation of Operations on Finite Abelian Group; 5. Applications; 6. Conclusion; Acknowledgement; References Chapter 11. SOME PROPERTIES OF THE PARALLEL BUBBLING ΑΝD PARALLEL SORTS ON A MESH-OONNEOTEOD ROOESSOR ARRAY1. Introduction; 2. Properties of the parallel bubbling; 3. Sorting on a mesh-connected processor array; 4· Lower Bounds on Computing Times; 5. Concluding remarks; References; Chapter 12. Game Solving Procedure HIs Unsurpassed; 1. Introduction; 2. Game Trees and Search Procedures; 3. Outline of the Proof; 4. Proof for Case A; 5. Proof for Case Β; 6. Some Properties ofH; 7. Proof for Case C; References; Chapter 13. Algorithmic Problems in Modeling and Electronic Prototyping; Introduction Electronic Prototyping |
| Record Nr. | UNINA-9910786630903321 |
| Orlando, Florida ; ; London, England : , : Academic Press, Inc., , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete algorithms and complexity : proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan / / edited by David S. Johnson [and three others]
| Discrete algorithms and complexity : proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan / / edited by David S. Johnson [and three others] |
| Pubbl/distr/stampa | Orlando, Florida ; ; London, England : , : Academic Press, Inc., , 1987 |
| Descrizione fisica | 1 online resource (497 p.) |
| Disciplina | 511 |
| Collana | Perspectives in Computing |
| Soggetto topico |
Computer programming
Computer algorithms Computational complexity |
| ISBN | 1-4832-7400-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Discrete Algorithms and Complexity; Copyright Page; Table of Contents; Contributors; Foreword; Chapter 1. An Upper Bound on the Expected Cost of an Optimal Assignment; Introduction; A Regularity Condition; The Transportation Problem and its Dual; Acknowledgement; References; Chapter 2. The Principal Partition of Vertex-Weighted Graphs and Its Applications; 1. Introduction; 2. The Principal Partition of Vertex-Weighted Graphs and Solution Algorithms For Problem 2; 3. Flow Assignment In The Graph Defined For Problem 4: Part 1
4. Flow Assignment In The Graph Defined For Problem 4: Part25. Applications; 6. Concluding Remarks; References; Chapter 3. Generalized Colorings; 0. Introduction; 1. Parameters; 2. Algorithmic Issues; 3. Obstructions; 4. The Homomorphism Order; REFERENCES; Chapter 4. Voronoi Diagram for Points in a Simple Polygon; 1. Introduction; 2. Sketch of the algorithm; 3. Constructing the weighted Voronoi diagram; References; Chapter 5. Computing the Geodesic Center of aSimple Polygon; 1. Introduction; 2. Uniqueness of Geodesic Center; 3. Geodesic Diameter of a Simple Polygon 4. Farthest-Point Voronoi DiagraReferences; Chapter 6. On deleting vertices to make a graph of positive genus planar; 1. Introduction; 2. Background in topologioal graph theory and order arithmetic; 3. The main result; 4. Conclusion; References; Chapter 7. Algorithms for Routing around a Rectangle; 1. Introduction; 2. Edge-disjoint paths; 3. Routing; 4. Minimum area routing; References; Chapter 8. A Remark on the Complexity of the Knapsack Problem; 1. Introduction; 2. The Basic Algorithm and a Restricted Modification; 3. The Three List Problem and its Relation to the Knapsack Problem ReferencesChapter 9. Fast, Rigorous Factorisation and Diecrete Logarltha Algoritluas; 1. Introduction; 2. A riaoroua version of the elliptic curve factorinamethod; 3. Factoring with random squares; 4. Discrete logarithes In GF(p); 5. DISCRETE LOGARITHMS OVERGF(2n); REFERENCES; Chapter 10. Redundant Coding for Local Computability; 1. Introduction; 2. Coding and Local Computability; 3. Addition on Residue Class; 4. High-speed Parallel Computation of Operations on Finite Abelian Group; 5. Applications; 6. Conclusion; Acknowledgement; References Chapter 11. SOME PROPERTIES OF THE PARALLEL BUBBLING ΑΝD PARALLEL SORTS ON A MESH-OONNEOTEOD ROOESSOR ARRAY1. Introduction; 2. Properties of the parallel bubbling; 3. Sorting on a mesh-connected processor array; 4· Lower Bounds on Computing Times; 5. Concluding remarks; References; Chapter 12. Game Solving Procedure HIs Unsurpassed; 1. Introduction; 2. Game Trees and Search Procedures; 3. Outline of the Proof; 4. Proof for Case A; 5. Proof for Case Β; 6. Some Properties ofH; 7. Proof for Case C; References; Chapter 13. Algorithmic Problems in Modeling and Electronic Prototyping; Introduction Electronic Prototyping |
| Record Nr. | UNINA-9910828232903321 |
| Orlando, Florida ; ; London, England : , : Academic Press, Inc., , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
