-
Principles of robot motion - theory, algorith...
Inbunden bok. MIT Press. 2005. 603 sidor.
Nära nyskick. English text.
Well illustrated with clear diagrams, graphs, schematic etc.
Unread condition.
FRI FRAKT inrikes
- ISBN
- 9780262033275
- Titel
- Principles of robot motion - theory, algorithms, and implementation
- Utgivningsår
- 2005
- Omfång
- 603 sidor
- Bandtyp
- Alk. paper
- Språk
- English
MIT Press 9780262033275 -
Teach Yourself Data Structures and Algorithms...
Häftad bok. 2014. 246 sidor.
ISBN 9781500137250
Nyskick. Out of stock. The author: IT Manager@Anonymous International.
This Book offers solutions to complex data structures and algorithms step by step. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview läs mer … läs merInrikes enhetsfrakt Sverige: 62 SEK
9781500137250 -
Theory and Algorithms for Linear Optimization...
Inbunden bok. Wiley Interscience Series in Discrete Mathematics, I. 1997. 482 sidor.
ISBN 9780471956761
Mycket gott skick. Skyddsomslag saknas.
Inrikes enhetsfrakt Sverige: 62 SEK
Wiley Interscience Series in Discrete Mathematics, I 9780471956761 -
Beta : mathematics handbook : concepts, theor...
Inbunden bok. Lund : Studentlitteratur ; Bromley : Chartwell-Bratt. 1990.
Mycket gott skick. Några nötta hörn och kanter
Namn i bokenInrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9789144250526
- Titel
- Beta : mathematics handbook : concepts, theorems, methods, algorithms, formulas, graphs, tables
- Författare
- Råde, Lennart - Westergren, Bertil
- Förlag
- Lund : Studentlitteratur ; Bromley : Chartwell-Bratt
- Utgivningsår
- 1990
- Språk
- English
Lund : Studentlitteratur ; Bromley : Chartwell-Bratt 9789144250526 -
Computer Algorithms
Inbunden bok. Addison Wesley. 3 uppl. 1999. 688 sidor.
Mycket gott skick. Skyddsomslag saknas. Pärmen är något repad och nött, och lite lös i ryggen. Papperet i boken är bitvis aningen vågigt, men annars nästan i nyskick. Leverans kan inom Stockholmsområdet göras av säljaren
personligen till överenskommen plats. Totalkostnaden blir
då 200 kr. Köp läs mer … läs merInrikes enhetsfrakt Sverige: 62 SEK- ISBN
- 9780201612448
- Titel
- Computer Algorithms
- Författare
- Sara Baase - Allen Gelder
- Förlag
- Addison Wesley
- Utgivningsår
- 1999
- Bandtyp
- Inbunden
- Vikt
- 1266 g
- Språk
- Svenska
Addison Wesley 3 9780201612448 -
Applied cryptography - protocols, algorithms...
Häftad bok. Bruse Schneider. 1994. 618 sidor.
Nära nyskick. Engelsk text Programming / Security
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780471597568
- Titel
- Applied cryptography - protocols, algorithms and source code in C
- Författare
- Schneier, Bruce
- Utgivningsår
- 1994
- Språk
- English
Bruse Schneider 9780471597568 -
Algorithms to Live By
Häftad bok. HarperCollins UK. 2017. 368 sidor.
Gott skick. Engelsk text. Litet märke i bakre pärm. Svaga bruksspår. Finns i Sthlm
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780007547999
- Titel
- Algorithms to Live By
- Författare
- Christian, Brian
- Förlag
- HarperCollins UK
- Utgivningsår
- 2017
- Omfång
- 368 sidor
- Bandtyp
- Mått
- 127 x 197 mm Ryggbredd 27 mm
- Vikt
- 340 g
- Språk
- English
- Baksidestext
- A fascinating exploration of how computer algorithms can be applied to our everyday lives. What should we do, or leave undone, in a day or a lifetime? Exploring how insights from computer algorithms can be applied to our everyday lives, 'Algorithms To Live By' helps to solve common decision-making problems and illuminate the workings of the human mind. When should you switch between different tasks, and how many tasks should you take on in the first place? How much messiness should you accept? What balance of new activities and familiar favourites is the most fulfilling? When computers face constraints of time and space, they too must untangle very human questions: how to have better hunches, when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. And the solutions they've found have much to teach us. Acclaimed author Brian Christian and cognitive scientist Tom Griffiths show how the algorithms developed for computers can be applied from finding your spouse to finding a parking spot, from organizing your inbox to understanding the workings of memory.
HarperCollins UK 9780007547999 -
Operations research - applications and algori...
Inbunden bok. Duxbury Press. 3 uppl. 1994. 1318 sidor.
Mycket gott skick.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780534209711
- Titel
- Operations research - applications and algorithms
- Författare
- Winston, Wayne L
- Förlag
- Duxbury Press
- Utgivningsår
- 1994
- Omfång
- 1318 sidor
Duxbury Press 3 9780534209711 -
Introduction to algorithms
Häftad bok. Cambridge, Mass. : MIT Press ; New York : McGraw-Hill. 1992.
Mycket gott skick. Lite nagg i kanterna på omslaget. Inga understrykningar.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780262530910
- Titel
- Introduction to algorithms
- Författare
- Cormen, Thomas H. - Leiserson, Charles Eric - Rivest, Ronald L.
- Förlag
- Cambridge, Mass. : MIT Press ; New York : McGraw-Hill
- Språk
- English
Cambridge, Mass. : MIT Press ; New York : McGraw-Hill 9780262530910 -
Inrikes enhetsfrakt Sverige: 62 SEK
1617292583
-
Introduction to the design & analysis of algo...
Häftad bok.
Dåligt skick. 2003 Kraftigt nött Namnteckning
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 032121076X
- Titel
- Introduction to the Design and Analysis of Algorithms
- Författare
- Levitin
- Förlag
- Pearson Education
- Utgivningsår
- 2002
- Omfång
- 528 sidor
- Bandtyp
- Vikt
- 822 g
- Språk
- Svenska
032121076X -
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 032157351X
- Titel
- Algorithms
- Författare
- Sedgewick, Robert
- Utgivningsår
- 2011
- Bandtyp
- Hardcover : alk. paper
- Språk
- English
- Baksidestext
- This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.
032157351X -
JPEG2000 Standard for Image Compression: Conc...
Inbunden bok. John Wiley & Sons. 1 uppl. 2004. 250 sidor.
Mycket gott skick. Har tillhört bibliotek Mkt fint skick
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780471484226
- Titel
- JPEG2000 Standard for Image Compression: Concepts, Algorithms and VLSI Arch
- Författare
- Tinku Acharya
- Förlag
- John Wiley & Sons
- Utgivningsår
- 2004
- Omfång
- 250 sidor
- Bandtyp
- Inbunden
- Vikt
- 500 g
- Språk
- English
John Wiley & Sons 1 9780471484226 -
Digital video and HD - algorithms and interfa...
Inbunden bok. 2 uppl. 2012.
Nära nyskick. Illustrerat laminatband Utmärkt skick
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780123919267
- Titel
- Digital video and HD - algorithms and interfaces
- Författare
- Poynton, Charles A.
- Utgivningsår
- 2012
- Bandtyp
- Hbk
- Språk
- English
2 9780123919267 -
Accuracy and stability of numerical algorithm...
Inbunden bok. SIAM. 2 uppl. 2002. 680 sidor.
Mycket gott skick. Skyddsomslag saknas.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780898715217
- Titel
- Accuracy and stability of numerical algorithms
- Författare
- Higham, Nicholas J.
- Förlag
- SIAM
- Utgivningsår
- 2002
SIAM 2 9780898715217 -
Inrikes enhetsfrakt Sverige: 62 SEK
9780669352986 -
Computer age statistical inference - algorith...
Inbunden bok. Cambridge University Press. 2016.
Mycket gott skick. Inga anteckningar, inga understrykningar.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9781107149892
- Titel
- Computer age statistical inference - algorithms, evidence, and data science
- Författare
- Efron, Bradley
- Utgivningsår
- 2016
- Bandtyp
- Hardback
- Språk
- English
Cambridge University Press 9781107149892 -
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9781852332686
- Titel
- Digraphs - theory, algorithms and applications
- Författare
- Bang-Jensen, Jørgen
- Utgivningsår
- 2001
- Bandtyp
- 3. pr., cop. 2002
- Språk
- English
9781852332686 -
Algorithms for VLSI Design Automation
Inbunden bok. John Wiley & Sons. 1 uppl. 1998. 340 sidor.
Mycket gott skick. Skyddsomslag saknas.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780471984894
- Titel
- Algorithms for VLSI Design Automation
- Författare
- Sabih H. Gerez
- Förlag
- John Wiley & Sons
- Utgivningsår
- 1998
- Omfång
- 340 sidor
- Bandtyp
- Inbunden
- Vikt
- 500 g
- Språk
- English
John Wiley & Sons 1 9780471984894 -
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9783211827598
- Titel
- Polynomial algorithms in computer algebra
- Författare
- Winkler, Franz
- Utgivningsår
- 1996
- Bandtyp
- Brosch
- Språk
- English
Springer 9783211827598 -
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9783211827598
- Titel
- Polynomial algorithms in computer algebra
- Författare
- Winkler, Franz
- Utgivningsår
- 1996
- Bandtyp
- Brosch
- Språk
- English
Springer 9783211827598 -
Beyond Mapping Concepts, Algorithms, and Issu...
Inbunden bok. John Wiley & Sons Inc. 1 uppl. 1993. 246 sidor.
ISBN 9780470236765
Nyskick.
Inrikes enhetsfrakt Sverige: 62 SEK
John Wiley & Sons Inc 1 9780470236765 -
Introduction to distributed algorithms
Häftad bok. Cambridge : Cambridge University Press. 2000.
Mycket gott skick.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780521794831
- Titel
- Introduction to distributed algorithms [Elektronisk resurs]
- Författare
- Tel, Gerard
- Förlag
- Cambridge : Cambridge University Press
- Utgivningsår
- 2000
- Språk
- English
- Baksidestext
- Bibliography
Includes index
Cambridge : Cambridge University Press 9780521794831 -
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780007547999
- Titel
- Algorithms to Live By
- Författare
- Christian, Brian
- Förlag
- HarperCollins UK
- Utgivningsår
- 2017
- Omfång
- 368 sidor
- Bandtyp
- Mått
- 127 x 197 mm Ryggbredd 27 mm
- Vikt
- 340 g
- Språk
- English
- Baksidestext
- A fascinating exploration of how computer algorithms can be applied to our everyday lives. What should we do, or leave undone, in a day or a lifetime? Exploring how insights from computer algorithms can be applied to our everyday lives, 'Algorithms To Live By' helps to solve common decision-making problems and illuminate the workings of the human mind. When should you switch between different tasks, and how many tasks should you take on in the first place? How much messiness should you accept? What balance of new activities and familiar favourites is the most fulfilling? When computers face constraints of time and space, they too must untangle very human questions: how to have better hunches, when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. And the solutions they've found have much to teach us. Acclaimed author Brian Christian and cognitive scientist Tom Griffiths show how the algorithms developed for computers can be applied from finding your spouse to finding a parking spot, from organizing your inbox to understanding the workings of memory.
William Collins 9780007547999 -
AAD, Algorithms-aided design – parametric str...
Häftad bok.
Mycket gott skick. Le Penseur Publisher 2018, häftad, 495 s, engelsk text, mkt gott skick. Algorithmic design is not simply the use of computer to design architecture and objects. Algorithms allow designers to overcome the limitations of traditional CAD software and 3D mode läs mer … läs mer
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9788895315300
- Titel
- AAD, Algorithms-aided design - parametric strategies using Grasshopper
- Författare
- Tedeschi, Arturo
- Utgivningsår
- 2014
- Omfång
- 495 sidor
- Språk
- English
9788895315300 -
Beta : mathematics handbook : concepts, theor...
Inbunden bok. Lund : Studentlitteratur ; Bromley : Chartwell-Bratt. 2 uppl. 1990. 494 sidor.
Gott skick. Skyddsomslag saknas. Gott skick. Namn skrivet på insida pärm och ett par anteckningar vid innehållsförteckning. Pärmen tappat färg i kanter pga av nötning. Sidorna fina. … läs mer
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9789144250526
- Titel
- Beta : mathematics handbook : concepts, theorems, methods, algorithms, formulas, graphs, tables
- Författare
- Råde, Lennart - Westergren, Bertil
- Förlag
- Lund : Studentlitteratur ; Bromley : Chartwell-Bratt
- Utgivningsår
- 1990
- Språk
- English
Lund : Studentlitteratur ; Bromley : Chartwell-Bratt 2 9789144250526 -
Applied Cryptography: Protocols, Algorithms,...
Häftad bok. John Wiley & Sons. 2 uppl. 1996. 784 sidor.
Mycket gott skick.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9780471117094
- Titel
- Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd Edit
- Författare
- Bruce Schneier
- Förlag
- John Wiley & Sons
- Utgivningsår
- 1996
- Omfång
- 784 sidor
- Bandtyp
- Häftad
- Mått
- 190 x 235 mm Ryggbredd 42 mm
- Vikt
- 1360 g
- Språk
- English
John Wiley & Sons 2 9780471117094 -
Problem solving with algorithms and data stru...
Häftad bok. Wilsonville, Or. : Franklin, Beedle & Associates. 2006. 357 sidor.
Hyggligt skick. Några enstaka anteckningar och understrykningar. Någon mindre kaffefläck.
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9781590280539
- Titel
- Problem solving with algorithms and data structures using Python
- Författare
- Miller, Bradley N. - Ranum, David L.
- Förlag
- Wilsonville, Or. : Franklin, Beedle & Associates
- Språk
- English
- Baksidestext
- Includes bibliographical references and index
Wilsonville, Or. : Franklin, Beedle & Associates 9781590280539 -
Grokking algorithms : an illustrated guide fo...
Häftad bok. Shelter Island : Manning. 2016. 300 sidor.
Mycket gott skick. Gallrat biblioteksexemplar i jättefint skick verkar oläst
Algorithms nothing more than step-by-step procedures for solving problems and most algorithms used by programmers have already been discovered, tested, and proven. Those wanting to take a hard p läs mer … läs merInrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9781617292231
- Titel
- Grokking algorithms : an illustrated guide for programmers and other curious people
- Författare
- Bhargava, Aditya Y.
- Förlag
- Shelter Island : Manning
- Språk
- English
Shelter Island : Manning 9781617292231 -
Inrikes enhetsfrakt Sverige: 62 SEK
- ISBN
- 9783642450297
- Titel
- Algorithms and Computation [Elektronisk resurs] 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings
- Författare
- Cai, Leizhen. - Cheng, Siu-Wing. - Lam, Tak-Wah. - SpringerLink (Online service)
- Förlag
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
- Utgivningsår
- 2013
- Språk
- English
- Baksidestext
- This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.
Invited Talk Paper -- Market Approach to Social Ads: The MyLikes Example and Related Problems -- Session 1A: Computational Geometry I -- Geodesic-Preserving Polygon Simplification -- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information -- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs -- Structure and Computation of Straight Skeletons in 3-Space -- Session 1B: Pattern Matching -- Pattern Matching with Non Overlapping Reversals – Approximation and On-line Algorithms -- Single and Multiple Consecutive Permutation Motif Search -- Beating O(nm) in Approximate LZW-Compressed Pattern Matching -- Less Space: Indexing for Queries with Wildcards -- Session 2A: Computational Complexity I -- On Determining Deep Holes of Generalized Reed-Solomon Codes -- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes -- Determinantal Complexities and Field Extensions -- Session 2B: Internet and Social Network Algorithms I -- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs -- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs -- The Complexity of Finding a Large Subgraph under Anonymity Constraints -- Session 3A: Graph Theory and Algorithms I -- On the Number of Edges of Fan-Crossing Free Graphs -- Cops and Robbers on Intersection Graphs -- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graph -- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs -- Session 3B: Scheduling Algorithms -- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds -- Better Bounds for Online k-Frame Throughput Maximization in Network Switches -- The Solvable Cases of a Scheduling Algorithm -- Session 4A: Computational Complexity II -- Exact Sublinear Binomial Sampling -- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas -- Dynamic Point Labeling is Strongly PSPACE-Complete -- Unsatisfiable CNF Formulas Contain Many Conflicts -- Session 4B: Computational Geometry II -- Pursuit Evasion on Polyhedral Surfaces -- Algorithms for Tolerated Tverberg Partitions -- Abstract Voronoi Diagrams with Disconnected Regions -- Terrain Visibility with Multiple Viewpoints -- Session 5A: Graph Theory and Algorithms II -- Exact Algorithms for Maximum Independent Set -- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs -- Testing Mutual Duality of Planar Graph -- Session 5B: Fixed-Parameter Tractable Algorithms -- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem -- Myhill-Nerode Methods for Hypergraphs -- Augmenting Graphs to Minimize the Diameter -- Session 6A: Algorithms and Data Structures I -- Top-k Document Retrieval in Compact Space and Near-Optimal Time -- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers -- Trajectory-Based Dynamic Map Labeling -- Session 6B: Internet and Social Network -- Algorithms II -- Asynchronous Rumor Spreading on Random Graphs -- Unit Cost Buyback Problem -- Faster Rumor Spreading with Multiple Calls -- Session 7A: Algorithmic Game Theory -- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy -- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items -- New Results on the Online Pricing Problem -- Session 7B: Algorithms and Data Structures II -- RAM-Efficient External Memory Sorting -- Succinct Data Structures for Representing Equivalence Classes -- Sliding Bloom Filters -- Session 8A: Graph Theory and Algorithms III -- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs -- Bounded Representations of Interval and Proper Interval Graphs -- Detecting and Counting Small Pattern Graphs -- An O∗(1.1939n) Time Algorithm for Minimum Weighted Dominating Induced Matching -- Session 8B: Approximation Algorithms I -- New Inapproximability Bounds for TSP -- Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise -- Tight Approximation Bounds for Connectivity with a Color-Spanning Set -- The Train Delivery Problem Revisited -- Session 9A: Computational Geometry III -- The Distance 4-Sector of Two Points Is Unique -- The Number of Different Unfoldings of Polyhedra -- Computing the Smallest Color-Spanning Axis-Parallel Square -- Session 9B: Approximation Algorithms II -- Euclidean Traveling Salesman Tours through Stochastic Neighborhoods -- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure -- Approximate ˇCech Complex in Low and High Dimensions -- Session 10A: Computational Complexity III -- Model Counting for Formulas of Bounded Clique- Width -- Computing Plurality Points and Condorcet Points in Euclidean Space -- Computing Minimum Tile Sets to Self-assemble Color Patterns -- Session 10B: Network Algorithms -- A Probabilistic Analysis of Kademlia Networks -- Approximating the Generalized Minimum Manhattan Network Problem -- Minmax Regret 1-Facility Location on Uncertain Path Networks.
Springer 1 9783642450297
Your country and preferred language.
Select your country Select languageDenna webbplats använder cookies för att säkerställa att du får den bästa upplevelsen.
Stäng
Välkommen till Sveriges största bokhandel
Här finns så gott som allt som givits ut på den svenska bokmarknaden under de senaste hundra åren.
- Handla mot faktura och öppet köp i 21 dagar
- Oavsett vikt och antal artiklar handlar du till enhetsfrakt från samma säljare i samma kundvagn
Beta : mathematics handbook : concepts, theorems, methods, algorithms, formulas, graphs, tables Råde, Lennart - Westergren, Bertil 1990. Lund : Studentlitteratur ; Bromley : Chartwell-Bratt 4 ex från 200 SEK
Introduction to algorithms Cormen, Thomas H. - Leiserson, Charles Eric - Rivest, Ronald L. Cambridge, Mass. : MIT Press ; New York : McGraw-Hill 1 ex 390 SEK
JPEG2000 Standard for Image Compression: Concepts, Algorithms and VLSI Arch Tinku Acharya Inbunden. 2004. John Wiley & Sons 1 ex 150 SEK
Computer age statistical inference - algorithms, evidence, and data science Efron, Bradley 2016 1 ex 190 SEK
