top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Can markets compute equilibria? [[electronic resource] /] / Hunter Monroe
Can markets compute equilibria? [[electronic resource] /] / Hunter Monroe
Autore Monroe Hunter
Pubbl/distr/stampa [Washington, D.C.], : International Monetary Fund, 2009
Descrizione fisica 1 online resource (22 p.)
Collana IMF working paper
Soggetto topico Computational complexity
Electronic data processing
Soggetto genere / forma Electronic books.
ISBN 1-4623-3560-8
1-4527-9750-1
9786612842467
1-4518-7171-6
1-282-84246-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Contents; I. Introduction; II. Is Computing Equilibria Difficult?; Table; 1. Payoff Matrix for the Prisoner's Dilemma; Figures; 1. NP-complete: Is there a Hamilton Cycle?; 2. P: Is this a Hamilton Cycle?; III. Are There Natural Problems with No Best Algorithm?; A. Superlinear vs. Blum Speedup; B. No Best Algorithm for Integer and Matrix Multiplication?; 3. Boolean circuit: Are at least two inputs "TRUE"?; C. The Power of Cancellation; D. No Best Algorithm for coNP-Complete Problems?; E. No Best Algorithm Versus No Algorithm at All; IV. Conclusion; 4. Is speedup inherited?; References
Record Nr. UNINA-9910464241403321
Monroe Hunter  
[Washington, D.C.], : International Monetary Fund, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Can Markets Compute Equilibria? / / Hunter Monroe
Can Markets Compute Equilibria? / / Hunter Monroe
Autore Monroe Hunter
Pubbl/distr/stampa Washington, D.C. : , : International Monetary Fund, , 2009
Descrizione fisica 1 online resource (22 p.)
Collana IMF Working Papers
Soggetto topico Computational complexity
Electronic data processing
Macroeconomics
Noncooperative Games
Microeconomic Behavior: Underlying Principles
Price Level
Inflation
Deflation
Asset prices
Prices
ISBN 1-4623-3560-8
1-4527-9750-1
9786612842467
1-4518-7171-6
1-282-84246-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Contents; I. Introduction; II. Is Computing Equilibria Difficult?; Table; 1. Payoff Matrix for the Prisoner's Dilemma; Figures; 1. NP-complete: Is there a Hamilton Cycle?; 2. P: Is this a Hamilton Cycle?; III. Are There Natural Problems with No Best Algorithm?; A. Superlinear vs. Blum Speedup; B. No Best Algorithm for Integer and Matrix Multiplication?; 3. Boolean circuit: Are at least two inputs "TRUE"?; C. The Power of Cancellation; D. No Best Algorithm for coNP-Complete Problems?; E. No Best Algorithm Versus No Algorithm at All; IV. Conclusion; 4. Is speedup inherited?; References
Record Nr. UNINA-9910788348303321
Monroe Hunter  
Washington, D.C. : , : International Monetary Fund, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Can Markets Compute Equilibria? / / Hunter Monroe
Can Markets Compute Equilibria? / / Hunter Monroe
Autore Monroe Hunter
Edizione [1st ed.]
Pubbl/distr/stampa Washington, D.C. : , : International Monetary Fund, , 2009
Descrizione fisica 1 online resource (22 p.)
Disciplina 511.3;511.352
Collana IMF Working Papers
Soggetto topico Computational complexity
Electronic data processing
Macroeconomics
Noncooperative Games
Microeconomic Behavior: Underlying Principles
Price Level
Inflation
Deflation
Asset prices
Prices
ISBN 1-4623-3560-8
1-4527-9750-1
9786612842467
1-4518-7171-6
1-282-84246-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Contents; I. Introduction; II. Is Computing Equilibria Difficult?; Table; 1. Payoff Matrix for the Prisoner's Dilemma; Figures; 1. NP-complete: Is there a Hamilton Cycle?; 2. P: Is this a Hamilton Cycle?; III. Are There Natural Problems with No Best Algorithm?; A. Superlinear vs. Blum Speedup; B. No Best Algorithm for Integer and Matrix Multiplication?; 3. Boolean circuit: Are at least two inputs "TRUE"?; C. The Power of Cancellation; D. No Best Algorithm for coNP-Complete Problems?; E. No Best Algorithm Versus No Algorithm at All; IV. Conclusion; 4. Is speedup inherited?; References
Record Nr. UNINA-9910827376803321
Monroe Hunter  
Washington, D.C. : , : International Monetary Fund, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Capturing Connectivity and Causality in Complex Industrial Processes / / by Fan Yang, Ping Duan, Sirish L. Shah, Tongwen Chen
Capturing Connectivity and Causality in Complex Industrial Processes / / by Fan Yang, Ping Duan, Sirish L. Shah, Tongwen Chen
Autore Yang Fan
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (99 p.)
Disciplina 670.42
Collana SpringerBriefs in Applied Sciences and Technology
Soggetto topico Computational complexity
Mathematical models
Control engineering
Chemical engineering
Statistics 
Complexity
Mathematical Modeling and Industrial Mathematics
Control and Systems Theory
Industrial Chemistry/Chemical Engineering
Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences
ISBN 3-319-05380-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Examples of Applications for Connectivity and Causality Analysis -- Description of Connectivity and Causality -- Capturing Connectivity and Causality from Process Knowledge -- Capturing Causality from Process Data -- Case Studies.
Record Nr. UNINA-9910299715503321
Yang Fan  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
CCC '15 : 30th Conference on Computational Complexity : June 17-19, 2015, Portland, Oregon, USA / / edited by David Zuckerman
CCC '15 : 30th Conference on Computational Complexity : June 17-19, 2015, Portland, Oregon, USA / / edited by David Zuckerman
Pubbl/distr/stampa Saarbrücken, Germany : , : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, , 2015
Descrizione fisica 1 online resource (682 pages)
Disciplina 511.3
Soggetto topico Computational complexity
ISBN 3-939897-81-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Altri titoli varianti Conference on Computational Complexity 2015
Proceedings of the 30th Conference on Computational Complexity
Record Nr. UNINA-9910376112103321
Saarbrücken, Germany : , : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
CCC 2008 : proceedings, Twenty-third annual IEEE Conference on Computational Complexity : : 23-26 June 2008, College Park, Maryland
CCC 2008 : proceedings, Twenty-third annual IEEE Conference on Computational Complexity : : 23-26 June 2008, College Park, Maryland
Pubbl/distr/stampa New York : , : IEEE, , 2008
Descrizione fisica 1 online resource (342 pages)
Soggetto topico Computational complexity
Nonlinear boundary value problems
Polynomials
ISBN 1-5090-8168-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996216638203316
New York : , : IEEE, , 2008
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
CCC 2008 : proceedings, Twenty-third annual IEEE Conference on Computational Complexity : : 23-26 June 2008, College Park, Maryland
CCC 2008 : proceedings, Twenty-third annual IEEE Conference on Computational Complexity : : 23-26 June 2008, College Park, Maryland
Pubbl/distr/stampa New York : , : IEEE, , 2008
Descrizione fisica 1 online resource (342 pages)
Soggetto topico Computational complexity
Nonlinear boundary value problems
Polynomials
ISBN 1-5090-8168-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910145677603321
New York : , : IEEE, , 2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
CCC 2017 : 32nd Computational Complexity Conference : July 6-9, 2017, Riga, Latvia / / edited by Ryan O'Donnell
CCC 2017 : 32nd Computational Complexity Conference : July 6-9, 2017, Riga, Latvia / / edited by Ryan O'Donnell
Pubbl/distr/stampa Germany : , : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, , 2017
Descrizione fisica 1 online resource (942 pages)
Disciplina 511.3
Soggetto topico Computational complexity
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Altri titoli varianti Computational Complexity Conference 2017
Proceedings of the 32nd Computational Complexity Conference
Record Nr. UNINA-9910376052103321
Germany : , : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Cellular automata in image processing and geometry / / edited by Paul Rosin, Andrew Adamatzky, Xianfang Sun
Cellular automata in image processing and geometry / / edited by Paul Rosin, Andrew Adamatzky, Xianfang Sun
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (312 p.)
Disciplina 511.35
Collana Emergence, Complexity and Computation
Soggetto topico Computational intelligence
Optical data processing
Computational complexity
Artificial intelligence
Computational Intelligence
Image Processing and Computer Vision
Complexity
Artificial Intelligence
ISBN 3-319-06431-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cellular Automata for Efficient Image and Video Compression -- Cellular Automata for Image Resizing -- Skeletonizing Digital Images with Cellular Automata -- Image Processing Algorithms Implementation Using Quantum Cellular Automata -- Edge Detection using Cellular Automata -- Copy-move forgery detection using cellular automata -- Active Image Forgery Detection using Cellular Automata -- Content-based image retrieval with cellular automata -- The Application of Cellular Automaton in Medical Semiautomatic Segmentation -- Convex Hulls and Metric Gabriel Graphs -- Cellular automaton shading for building envelopes -- Pattern Formation Using Cellular Automata and L-Systems: A Case Study in Producing Islamic Patterns -- Interactive Cellular Automata Systems for Creative Projects.
Record Nr. UNINA-9910299753903321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The Challenge of Reframing Engineering Education [[electronic resource] /] / by Dennis Sale
The Challenge of Reframing Engineering Education [[electronic resource] /] / by Dennis Sale
Autore Sale Dennis
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Singapore : , : Springer Singapore : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (146 p.)
Disciplina 507.11
Soggetto topico Engineering—Vocational guidance
Science education
Education—Data processing
Educational policy
Education and state
Computational complexity
Electrical engineering
Job Careers in Science and Engineering
Science Education
Computers and Education
Educational Policy and Politics
Complexity
Communications Engineering, Networks
ISBN 981-4560-29-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Producing curriculum outcomes -- Effective and creative learning design -- Assessing learning -- Using information-communication technologies to support learning and teaching -- Evaluating the CDIO experience -- Managing the change process: Approach, strategies and professional development.
Record Nr. UNINA-9910299708603321
Sale Dennis  
Singapore : , : Springer Singapore : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui