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.
Applied Satisfiability : Cryptography, Scheduling, and Coalitional Games
Applied Satisfiability : Cryptography, Scheduling, and Coalitional Games
Autore Liao Xiaojuan
Edizione [1st ed.]
Pubbl/distr/stampa Newark : , : John Wiley & Sons, Incorporated, , 2025
Descrizione fisica 1 online resource (275 pages)
Disciplina 006.3
Altri autori (Persone) KoshimuraMiyuki
Soggetto topico Boolean logic
Data encryption (Computer science)
Program transformation (Computer programming)
ISBN 9781394249817
1394249810
9781394249794
1394249799
9781394249800
1394249802
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9911019418303321
Liao Xiaojuan  
Newark : , : John Wiley & Sons, Incorporated, , 2025
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Joomla! search engine optimization [[electronic resource] ] : drive people to your site with this supercharged guide to Joomla! and search engine optimization / / Ric Shreves
Joomla! search engine optimization [[electronic resource] ] : drive people to your site with this supercharged guide to Joomla! and search engine optimization / / Ric Shreves
Autore Shreves Ric
Pubbl/distr/stampa Birmingham, : Packt Pub., 2012
Descrizione fisica 1 online resource (116 p.)
Disciplina 006.76
Collana Community experience distilled
Soggetto topico Web sites - Authoring programs
Web site development
Web sites - Design
Search engines
Program transformation (Computer programming)
Soggetto genere / forma Electronic books.
ISBN 1-282-11182-5
9786613804013
1-84951-877-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Copyright; Credits; About the Author; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: An Introduction to Search Engine Optimization; What is SEO?; SEO terminology; .htaccess; 301 redirect (also known as Permanent Redirect); 302 redirect (also known as Temporary Redirect or Found); 404 error (also known as Page Not Found); AdSense; AdWords; Alexa Rank; Alt attribute; Anchor; Backlink (also known as Inbound Link); Bing Webmaster; Black hat; Bot (also known as robot, spider, or crawler); Canonical URLs; Cloaking; Crawl depth; Deep link
Doorway page (also known as gateway page)Duplicate content penalty; Google Webmaster; Internal link density; KEI; Keyphrase density (also known as keyword density); Keyword (or keyphrase); Keyphrase stuffing; Landing page; Link building; Link farm; Link text (also known as anchor text); Long tail; Meta tags; MozRank; nofollow; Organic rank; Outbound link; Page rank; PPC; Reciprocal link; Redirect; Robots.txt; SEF URLs; SEM; SEOMoz; SERP; SMO; Splash page; Stop word; White hat; XML site map; How search engines assess sites; Summary; Chapter 2: Configuring Joomla's SEO Options
Setting up Search Engine Friendly URLs Configuring URL aliases; Creating URL aliases for your articles; Controlling the title tag; Article title vs. page title (title tag); Managing metadata; Summary; Chapter 3: Useful Extensions to Enhance SEO; Finding SEO modules; Top SEO modules for Joomla!; AceSEF; Advanced Title Manager; Easy Frontend SEO; Facebook-Twitter-Google+1; iJoomla SEO; JoomSEF; Nice Social Bookmark; obRSS; RSSeo Suite; SEO Canonicalisation Plugin; SEO Friendly Links and Images; SEO-Generator; SEO Links Pro; SEOSimple; sh404SEF; Ultimate Site Tools; Xmap
Installing and configuring common SEO modules Implementing metadata management; Setting up canonical URLs; Setting up your XML site map; Implementing control over your Alt and Title attributes; Setting up cross-posting to social networks; Providing social bookmarking; Summary; Chapter 4: Getting Ready for Launch; Determining your SEO strategy; Identifying keywords; Assessing keyword effectiveness; Tapping into the power of stemming and variants; Content strategies for enhancing search engine ranking; Setting up third party services that can assist with SEO
Getting started with Google Analytics Working with Google Webmaster Tools; Working with Bing Webmaster Tools; Summary; Chapter 5: Managing SEO on a Live Site; Link building; Identifying quality link partners; Managing a link marketing campaign; Creating your own links; Directories; Press releases; Video and file sharing; Social media optimization; Reporting and tracking; Popularity metrics; Traffic source metrics; e-Business metrics; Link metrics; Summary; Index
Record Nr. UNINA-9910452648503321
Shreves Ric  
Birmingham, : Packt Pub., 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Joomla! search engine optimization [[electronic resource] ] : drive people to your site with this supercharged guide to Joomla! and search engine optimization / / Ric Shreves
Joomla! search engine optimization [[electronic resource] ] : drive people to your site with this supercharged guide to Joomla! and search engine optimization / / Ric Shreves
Autore Shreves Ric
Pubbl/distr/stampa Birmingham, : Packt Pub., 2012
Descrizione fisica 1 online resource (116 p.)
Disciplina 006.76
Collana Community experience distilled
Soggetto topico Web sites - Authoring programs
Web site development
Web sites - Design
Search engines
Program transformation (Computer programming)
ISBN 1-282-11182-5
9786613804013
1-84951-877-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Copyright; Credits; About the Author; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: An Introduction to Search Engine Optimization; What is SEO?; SEO terminology; .htaccess; 301 redirect (also known as Permanent Redirect); 302 redirect (also known as Temporary Redirect or Found); 404 error (also known as Page Not Found); AdSense; AdWords; Alexa Rank; Alt attribute; Anchor; Backlink (also known as Inbound Link); Bing Webmaster; Black hat; Bot (also known as robot, spider, or crawler); Canonical URLs; Cloaking; Crawl depth; Deep link
Doorway page (also known as gateway page)Duplicate content penalty; Google Webmaster; Internal link density; KEI; Keyphrase density (also known as keyword density); Keyword (or keyphrase); Keyphrase stuffing; Landing page; Link building; Link farm; Link text (also known as anchor text); Long tail; Meta tags; MozRank; nofollow; Organic rank; Outbound link; Page rank; PPC; Reciprocal link; Redirect; Robots.txt; SEF URLs; SEM; SEOMoz; SERP; SMO; Splash page; Stop word; White hat; XML site map; How search engines assess sites; Summary; Chapter 2: Configuring Joomla's SEO Options
Setting up Search Engine Friendly URLs Configuring URL aliases; Creating URL aliases for your articles; Controlling the title tag; Article title vs. page title (title tag); Managing metadata; Summary; Chapter 3: Useful Extensions to Enhance SEO; Finding SEO modules; Top SEO modules for Joomla!; AceSEF; Advanced Title Manager; Easy Frontend SEO; Facebook-Twitter-Google+1; iJoomla SEO; JoomSEF; Nice Social Bookmark; obRSS; RSSeo Suite; SEO Canonicalisation Plugin; SEO Friendly Links and Images; SEO-Generator; SEO Links Pro; SEOSimple; sh404SEF; Ultimate Site Tools; Xmap
Installing and configuring common SEO modules Implementing metadata management; Setting up canonical URLs; Setting up your XML site map; Implementing control over your Alt and Title attributes; Setting up cross-posting to social networks; Providing social bookmarking; Summary; Chapter 4: Getting Ready for Launch; Determining your SEO strategy; Identifying keywords; Assessing keyword effectiveness; Tapping into the power of stemming and variants; Content strategies for enhancing search engine ranking; Setting up third party services that can assist with SEO
Getting started with Google Analytics Working with Google Webmaster Tools; Working with Bing Webmaster Tools; Summary; Chapter 5: Managing SEO on a Live Site; Link building; Identifying quality link partners; Managing a link marketing campaign; Creating your own links; Directories; Press releases; Video and file sharing; Social media optimization; Reporting and tracking; Popularity metrics; Traffic source metrics; e-Business metrics; Link metrics; Summary; Index
Record Nr. UNINA-9910779496103321
Shreves Ric  
Birmingham, : Packt Pub., 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Joomla! search engine optimization : drive people to your site with this supercharged guide to Joomla! and search engine optimization / / Ric Shreves
Joomla! search engine optimization : drive people to your site with this supercharged guide to Joomla! and search engine optimization / / Ric Shreves
Autore Shreves Ric
Edizione [1st ed.]
Pubbl/distr/stampa Birmingham, : Packt Pub., 2012
Descrizione fisica 1 online resource (116 p.)
Disciplina 006.76
Collana Community experience distilled
Soggetto topico Web sites - Authoring programs
Web site development
Web sites - Design
Search engines
Program transformation (Computer programming)
ISBN 9786613804013
9781282111820
1282111825
9781849518772
1849518777
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Copyright; Credits; About the Author; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: An Introduction to Search Engine Optimization; What is SEO?; SEO terminology; .htaccess; 301 redirect (also known as Permanent Redirect); 302 redirect (also known as Temporary Redirect or Found); 404 error (also known as Page Not Found); AdSense; AdWords; Alexa Rank; Alt attribute; Anchor; Backlink (also known as Inbound Link); Bing Webmaster; Black hat; Bot (also known as robot, spider, or crawler); Canonical URLs; Cloaking; Crawl depth; Deep link
Doorway page (also known as gateway page)Duplicate content penalty; Google Webmaster; Internal link density; KEI; Keyphrase density (also known as keyword density); Keyword (or keyphrase); Keyphrase stuffing; Landing page; Link building; Link farm; Link text (also known as anchor text); Long tail; Meta tags; MozRank; nofollow; Organic rank; Outbound link; Page rank; PPC; Reciprocal link; Redirect; Robots.txt; SEF URLs; SEM; SEOMoz; SERP; SMO; Splash page; Stop word; White hat; XML site map; How search engines assess sites; Summary; Chapter 2: Configuring Joomla's SEO Options
Setting up Search Engine Friendly URLs Configuring URL aliases; Creating URL aliases for your articles; Controlling the title tag; Article title vs. page title (title tag); Managing metadata; Summary; Chapter 3: Useful Extensions to Enhance SEO; Finding SEO modules; Top SEO modules for Joomla!; AceSEF; Advanced Title Manager; Easy Frontend SEO; Facebook-Twitter-Google+1; iJoomla SEO; JoomSEF; Nice Social Bookmark; obRSS; RSSeo Suite; SEO Canonicalisation Plugin; SEO Friendly Links and Images; SEO-Generator; SEO Links Pro; SEOSimple; sh404SEF; Ultimate Site Tools; Xmap
Installing and configuring common SEO modules Implementing metadata management; Setting up canonical URLs; Setting up your XML site map; Implementing control over your Alt and Title attributes; Setting up cross-posting to social networks; Providing social bookmarking; Summary; Chapter 4: Getting Ready for Launch; Determining your SEO strategy; Identifying keywords; Assessing keyword effectiveness; Tapping into the power of stemming and variants; Content strategies for enhancing search engine ranking; Setting up third party services that can assist with SEO
Getting started with Google Analytics Working with Google Webmaster Tools; Working with Bing Webmaster Tools; Summary; Chapter 5: Managing SEO on a Live Site; Link building; Identifying quality link partners; Managing a link marketing campaign; Creating your own links; Directories; Press releases; Video and file sharing; Social media optimization; Reporting and tracking; Popularity metrics; Traffic source metrics; e-Business metrics; Link metrics; Summary; Index
Record Nr. UNINA-9910957307003321
Shreves Ric  
Birmingham, : Packt Pub., 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Learning and intelligent optimization : 4th International Conference, LION 4, Venice, Italy, January 18-22, 2010 : selected papers / / Christian Blum, Roberto Battiti, (eds.)
Learning and intelligent optimization : 4th International Conference, LION 4, Venice, Italy, January 18-22, 2010 : selected papers / / Christian Blum, Roberto Battiti, (eds.)
Edizione [1st ed.]
Pubbl/distr/stampa New York, : Springer, 2010
Descrizione fisica 1 online resource (XIV, 344 p. 97 illus.)
Disciplina 005.1
Altri autori (Persone) BlumChristian <1972->
BattitiRoberto <1961->
Collana Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Soggetto topico Computational intelligence
Mathematical optimization
Program transformation (Computer programming)
ISBN 1-280-38739-4
9786613565310
3-642-13800-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Main Track (Regular Papers) -- A Column Generation Heuristic for the General Vehicle Routing Problem -- A Combination of Evolutionary Algorithm, Mathematical Programming, and a New Local Search Procedure for the Just-In-Time Job-Shop Scheduling Problem -- A Math-Heuristic Algorithm for the DNA Sequencing Problem -- A Randomized Iterated Greedy Algorithm for the Founder Sequence Reconstruction Problem -- Adaptive “Anytime” Two-Phase Local Search -- Adaptive Filter SQP -- Algorithm Selection as a Bandit Problem with Unbounded Losses -- Bandit-Based Estimation of Distribution Algorithms for Noisy Optimization: Rigorous Runtime Analysis -- Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search -- Distance Functions, Clustering Algorithms and Microarray Data Analysis -- Gaussian Process Assisted Particle Swarm Optimization -- Learning of Highly-Filtered Data Manifold Using Spectral Methods -- Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables -- Main Track (Short Papers) -- A Linear Approximation of the Value Function of an Approximate Dynamic Programming Approach for the Ship Scheduling Problem -- A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning -- A Network Approach for Restructuring the Korean Freight Railway Considering Customer Behavior -- A Parallel Multi-Objective Evolutionary Algorithm for Phylogenetic Inference -- Convergence of Probability Collectives with Adaptive Choice of Temperature Parameters -- Generative Topographic Mapping for Dimension Reduction in Engineering Design -- Learning Decision Trees for the Analysis of Optimization Heuristics -- On the Coordination of Multidisciplinary Design Optimization Using Expert Systems -- On the Potentials of Parallelizing Large Neighbourhood Search for Rich Vehicle Routing Problems -- Optimized Ensembles for Clustering Noisy Data -- Stochastic Local Search for the Optimization of Secondary Structure Packing in Proteins -- Systematic Improvement of Monte-Carlo Tree Search with Self-generated Neural-Networks Controllers -- Special Session: LION-SWOP -- Grapheur: A Software Architecture for Reactive and Interactive Optimization -- The EvA2 Optimization Framework -- Special Session: LION-CCEC -- Feature Extraction from Optimization Data via DataModeler’s Ensemble Symbolic Regression -- Special Session: LION-PP -- Understanding TSP Difficulty by Learning from Evolved Instances -- Time-Bounded Sequential Parameter Optimization -- Pitfalls in Instance Generation for Udine Timetabling -- Special Session: LION-MOME -- A Study of the Parallelization of the Multi-Objective Metaheuristic MOEA/D -- An Interactive Evolutionary Multi-objective Optimization Method Based on Polyhedral Cones -- On the Distribution of EMOA Hypervolumes -- Adapting to a Realistic Decision Maker: Experiments towards a Reactive Multi-objective Optimizer.
Record Nr. UNINA-9910483740903321
New York, : Springer, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Optimization in engineering sciences [[electronic resource] ] : exact methods / / Pierre Borne ... [et al.]
Optimization in engineering sciences [[electronic resource] ] : exact methods / / Pierre Borne ... [et al.]
Autore Borne Pierre
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (328 p.)
Disciplina 519.92
629.89
Altri autori (Persone) BornePierre
Collana ISTE
Soggetto topico Engineering mathematics
Mathematical optimization
Program transformation (Computer programming)
Algorithms
Systems engineering
ISBN 1-118-57789-2
1-299-14153-6
1-118-57775-2
1-118-57784-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Title Page; Contents; Foreword; Preface; List of Acronyms; Chapter 1. Linear Programming; 1.1. Objective of linear programming; 1.2. Stating the problem; 1.3. Lagrange method; 1.4. Simplex algorithm; 1.4.1. Principle; 1.4.2. Simplicial form formulation; 1.4.3. Transition from one simplicial form to another; 1.4.4. Summary of the simplex algorithm; 1.5. Implementation example; 1.6. Linear programming applied to the optimization of resource allocation; 1.6.1. Areas of application; 1.6.2. Resource allocation for advertising; 1.6.3. Optimization of a cut of paper rolls
1.6.4. Structure of linear program of an optimal control problemChapter 2. Nonlinear Programming; 2.1. Problem formulation; 2.2. Karush-Kuhn-Tucker conditions; 2.3. General search algorithm; 2.3.1. Main steps; 2.3.2. Computing the search direction; 2.3.3. Computation of advancement step; 2.4. Monovariable methods; 2.4.1. Coggin's method (of polynomial interpolation); 2.4.2. Golden section method; 2.5. Multivariable methods; 2.5.1. Direct search methods; 2.5.2. Gradient methods; Chapter 3. Dynamic Programming; 3.1. Principle of dynamic programming; 3.1.1. Stating the problem
3.1.2. Decision problem3.2. Recurrence equation of optimality; 3.3. Particular cases; 3.3.1. Infinite horizon stationary problems; 3.3.2. Variable horizon problem; 3.3.3. Random horizon problem; 3.3.4. Taking into account sum-like constraints; 3.3.5. Random evolution law; 3.3.6. Initialization when the final state is imposed; 3.3.7. The case when the necessary information is not always available; 3.4. Examples; 3.4.1. Route optimization; 3.4.2. The smuggler problem; Chapter 4. Hopfield Networks; 4.1. Structure; 4.2. Continuous dynamic Hopfield networks; 4.2.1. General problem
4.2.2. Application to the traveling salesman problem4.3. Optimization by Hopfield networks, based on simulated annealing; 4.3.1. Deterministic method; 4.3.2. Stochastic method; Chapter 5. Optimization in System Identification; 5.1. The optimal identification principle; 5.2. Formulation of optimal identification problems; 5.2.1. General problem; 5.2.2. Formulation based on optimization theory; 5.2.3. Formulation based on estimation theory (statistics); 5.3. Usual identification models; 5.3.1. General model; 5.3.2. Rational input/output (RIO) models
5.3.3. Class of autoregressive models (ARMAX)5.3.4. Class of state space representation models; 5.4. Basic least squares method; 5.4.1. LSM type solution; 5.4.2. Geometric interpretation of the LSM solution; 5.4.3. Consistency of the LSM type solution; 5.4.4. Example of application of the LSM for an ARX model; 5.5. Modified least squares methods; 5.5.1. Recovering lost consistency; 5.5.2. Extended LSM; 5.5.3. Instrumental variables method; 5.6. Minimum prediction error method; 5.6.1. Basic principle and algorithm; 5.6.2. Implementation of the MPEM for ARMAX models
5.6.3. Convergence and consistency of MPEM type estimations
Record Nr. UNINA-9910141493603321
Borne Pierre  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Optimization in engineering sciences : exact methods / / Pierre Borne ... [et al.]
Optimization in engineering sciences : exact methods / / Pierre Borne ... [et al.]
Autore Borne Pierre
Edizione [1st ed.]
Pubbl/distr/stampa Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Descrizione fisica 1 online resource (328 p.)
Disciplina 519.92
629.89
Altri autori (Persone) BornePierre
Collana ISTE
Soggetto topico Engineering mathematics
Mathematical optimization
Program transformation (Computer programming)
Algorithms
Systems engineering
ISBN 9781118577899
1118577892
9781299141537
1299141536
9781118577752
1118577752
9781118577844
1118577841
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Title Page; Contents; Foreword; Preface; List of Acronyms; Chapter 1. Linear Programming; 1.1. Objective of linear programming; 1.2. Stating the problem; 1.3. Lagrange method; 1.4. Simplex algorithm; 1.4.1. Principle; 1.4.2. Simplicial form formulation; 1.4.3. Transition from one simplicial form to another; 1.4.4. Summary of the simplex algorithm; 1.5. Implementation example; 1.6. Linear programming applied to the optimization of resource allocation; 1.6.1. Areas of application; 1.6.2. Resource allocation for advertising; 1.6.3. Optimization of a cut of paper rolls
1.6.4. Structure of linear program of an optimal control problemChapter 2. Nonlinear Programming; 2.1. Problem formulation; 2.2. Karush-Kuhn-Tucker conditions; 2.3. General search algorithm; 2.3.1. Main steps; 2.3.2. Computing the search direction; 2.3.3. Computation of advancement step; 2.4. Monovariable methods; 2.4.1. Coggin's method (of polynomial interpolation); 2.4.2. Golden section method; 2.5. Multivariable methods; 2.5.1. Direct search methods; 2.5.2. Gradient methods; Chapter 3. Dynamic Programming; 3.1. Principle of dynamic programming; 3.1.1. Stating the problem
3.1.2. Decision problem3.2. Recurrence equation of optimality; 3.3. Particular cases; 3.3.1. Infinite horizon stationary problems; 3.3.2. Variable horizon problem; 3.3.3. Random horizon problem; 3.3.4. Taking into account sum-like constraints; 3.3.5. Random evolution law; 3.3.6. Initialization when the final state is imposed; 3.3.7. The case when the necessary information is not always available; 3.4. Examples; 3.4.1. Route optimization; 3.4.2. The smuggler problem; Chapter 4. Hopfield Networks; 4.1. Structure; 4.2. Continuous dynamic Hopfield networks; 4.2.1. General problem
4.2.2. Application to the traveling salesman problem4.3. Optimization by Hopfield networks, based on simulated annealing; 4.3.1. Deterministic method; 4.3.2. Stochastic method; Chapter 5. Optimization in System Identification; 5.1. The optimal identification principle; 5.2. Formulation of optimal identification problems; 5.2.1. General problem; 5.2.2. Formulation based on optimization theory; 5.2.3. Formulation based on estimation theory (statistics); 5.3. Usual identification models; 5.3.1. General model; 5.3.2. Rational input/output (RIO) models
5.3.3. Class of autoregressive models (ARMAX)5.3.4. Class of state space representation models; 5.4. Basic least squares method; 5.4.1. LSM type solution; 5.4.2. Geometric interpretation of the LSM solution; 5.4.3. Consistency of the LSM type solution; 5.4.4. Example of application of the LSM for an ARX model; 5.5. Modified least squares methods; 5.5.1. Recovering lost consistency; 5.5.2. Extended LSM; 5.5.3. Instrumental variables method; 5.6. Minimum prediction error method; 5.6.1. Basic principle and algorithm; 5.6.2. Implementation of the MPEM for ARMAX models
5.6.3. Convergence and consistency of MPEM type estimations
Record Nr. UNINA-9910806124003321
Borne Pierre  
Hoboken, N.J., : ISTE Ltd/John Wiley and Sons Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Program specialization [[electronic resource] /] / Renaud Marlet
Program specialization [[electronic resource] /] / Renaud Marlet
Autore Marlet Renaud
Pubbl/distr/stampa Hoboken, N.J., : John Wiley & Sons, Inc., 2013
Descrizione fisica 1 online resource (560 p.)
Disciplina 005.1
Collana Computer engineering series
Soggetto topico Program transformation (Computer programming)
ISBN 1-118-57698-5
1-299-14643-0
1-118-57700-0
1-118-57686-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Title Page; Contents; Chapter 1. Main Principles of Program Specialization; 1.1. Specialized program; 1.1.1. Program specialization; 1.1.2. Context of specialization; 1.1.3. Specialization of a fragment of program; 1.1.4. Partial computations; 1.1.5. Range of specializations; 1.1.6. Equivalence between the specialized program and the generic program; 1.2. Specializing to improve performance; 1.2.1. Execution time; 1.2.2. Memory space; 1.2.3. Effect of the compiler; 1.2.4. Opacity of the code generated; 1.2.5. Effect of the memory cache; 1.3. Automatic specialization; 1.3.1. Specializer
1.3.2. Operation of specialization1.3.3. Execution times; 1.3.4. Advantages and disadvantages to automatic specialization; 1.4. Main applications of specialization; 1.4.1. Application 1: compiling using an interpreter; 1.4.2. Application 2: transforming an interpreter into a compiler; 1.4.3. Application 3: creating a compiler generator; 1.5. Specialization times; 1.5.1. Compile-time specialization; 1.5.2. Runtime specialization; 1.5.3. Specialization server; 1.5.4. Specialized code cache; 1.6. Financial viability of specialization; 1.6.1. Specialization gain; 1.6.2. Specialization time
1.6.3. Size of the specializer1.6.4. Specialization before execution; 1.6.5. Runtime specialization and break-even point; Chapter 2. Specialization Techniques; 2.1. Transforming specialization programs; 2.1.1. Partial evaluation; 2.1.2. Specialization strategies; 2.1.3. Formulation of specialization using general transformations; 2.1.4. Formulation of specialization using ad hoc transformations; 2.1.5. Techniques for executing precomputations; 2.1.6. Speculative specialization; 2.1.7. Interprocedural specialization; 2.1.8. Polyvariant specialization; 2.2. Termination of specialization
2.2.1. Online control2.2.2. Offline control; 2.3. Correctness of specialization; 2.3.1. Soundness, completeness and correctness; 2.3.2. Remedying laziness; 2.3.3. Execution error handling; 2.3.4. Portability; 2.3.5. Pre-processor; 2.4. Other forms of specialization; 2.4.1. Driving and supercompilation; 2.4.2. Generalized partial computation; 2.4.3. Configurable partial computation; 2.4.4. Program slicing; 2.4.5. Comparison with a compiler; 2.4.6. Comparison with a multilevel language; Chapter 3. Offline Specialization; 3.1. Main principles of offline specialization
3.1.1. Specification of input binding times3.1.2. Binding-time analysis; 3.1.3. Specialization by binding-time interpretation; 3.1.4. Action analysis; 3.1.5. Specialization by action interpretation; 3.1.6. Generating extension; 3.1.7. Compiler generator; 3.1.8. Generation of a specialized program; 3.1.9. Offline specializer; 3.1.10. Correction of offline specialization; 3.1.11. Specialization grammar; 3.1.12. Polyvariant offline specialization; 3.2. Compared advantages of offline specialization; 3.2.1. Evaluation a priori of the specialization degree
3.2.2. Visualization of specialization information
Record Nr. UNINA-9910141494003321
Marlet Renaud  
Hoboken, N.J., : John Wiley & Sons, Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Program specialization / / Renaud Marlet
Program specialization / / Renaud Marlet
Autore Marlet Renaud
Edizione [1st ed.]
Pubbl/distr/stampa Hoboken, N.J., : John Wiley & Sons, Inc., 2013
Descrizione fisica 1 online resource (560 p.)
Disciplina 005.1
Collana Computer engineering series
Soggetto topico Program transformation (Computer programming)
ISBN 9781118576984
1118576985
9781299146433
1299146430
9781118577004
1118577000
9781118576861
1118576861
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Title Page; Contents; Chapter 1. Main Principles of Program Specialization; 1.1. Specialized program; 1.1.1. Program specialization; 1.1.2. Context of specialization; 1.1.3. Specialization of a fragment of program; 1.1.4. Partial computations; 1.1.5. Range of specializations; 1.1.6. Equivalence between the specialized program and the generic program; 1.2. Specializing to improve performance; 1.2.1. Execution time; 1.2.2. Memory space; 1.2.3. Effect of the compiler; 1.2.4. Opacity of the code generated; 1.2.5. Effect of the memory cache; 1.3. Automatic specialization; 1.3.1. Specializer
1.3.2. Operation of specialization1.3.3. Execution times; 1.3.4. Advantages and disadvantages to automatic specialization; 1.4. Main applications of specialization; 1.4.1. Application 1: compiling using an interpreter; 1.4.2. Application 2: transforming an interpreter into a compiler; 1.4.3. Application 3: creating a compiler generator; 1.5. Specialization times; 1.5.1. Compile-time specialization; 1.5.2. Runtime specialization; 1.5.3. Specialization server; 1.5.4. Specialized code cache; 1.6. Financial viability of specialization; 1.6.1. Specialization gain; 1.6.2. Specialization time
1.6.3. Size of the specializer1.6.4. Specialization before execution; 1.6.5. Runtime specialization and break-even point; Chapter 2. Specialization Techniques; 2.1. Transforming specialization programs; 2.1.1. Partial evaluation; 2.1.2. Specialization strategies; 2.1.3. Formulation of specialization using general transformations; 2.1.4. Formulation of specialization using ad hoc transformations; 2.1.5. Techniques for executing precomputations; 2.1.6. Speculative specialization; 2.1.7. Interprocedural specialization; 2.1.8. Polyvariant specialization; 2.2. Termination of specialization
2.2.1. Online control2.2.2. Offline control; 2.3. Correctness of specialization; 2.3.1. Soundness, completeness and correctness; 2.3.2. Remedying laziness; 2.3.3. Execution error handling; 2.3.4. Portability; 2.3.5. Pre-processor; 2.4. Other forms of specialization; 2.4.1. Driving and supercompilation; 2.4.2. Generalized partial computation; 2.4.3. Configurable partial computation; 2.4.4. Program slicing; 2.4.5. Comparison with a compiler; 2.4.6. Comparison with a multilevel language; Chapter 3. Offline Specialization; 3.1. Main principles of offline specialization
3.1.1. Specification of input binding times3.1.2. Binding-time analysis; 3.1.3. Specialization by binding-time interpretation; 3.1.4. Action analysis; 3.1.5. Specialization by action interpretation; 3.1.6. Generating extension; 3.1.7. Compiler generator; 3.1.8. Generation of a specialized program; 3.1.9. Offline specializer; 3.1.10. Correction of offline specialization; 3.1.11. Specialization grammar; 3.1.12. Polyvariant offline specialization; 3.2. Compared advantages of offline specialization; 3.2.1. Evaluation a priori of the specialization degree
3.2.2. Visualization of specialization information
Record Nr. UNINA-9910828308003321
Marlet Renaud  
Hoboken, N.J., : John Wiley & Sons, Inc., 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui