📄 New blog post: We finished the Chinese release
✕

Anna’s Archive

📚 The largest truly open library in human history. 📈 61,344,044 books, 95,527,824 papers — preserved forever.
AA 38TB
direct uploads
IA 304TB
scraped by AA
DuXiu 298TB
scraped by AA
Hathi 9TB
scraped by AA
Libgen.li 188TB
collab with AA
Z-Lib 77TB
collab with AA
Libgen.rs 82TB
mirrored by AA
Sci-Hub 90TB
mirrored by AA
⭐️ Our code and data are 100% open source. Learn more…
✕ Recent downloads:  
Home Home Home Home
Anna’s Archive
Home
Search
Donate
🧬 SciDB
FAQ
Account
Log in / Register
Account
Public profile
Downloaded files
My donations
Referrals
Explore
Activity
Codes Explorer
ISBN Visualization ↗
Community Projects ↗
Open data
Datasets
Torrents
LLM data
Stay in touch
Contact email
Anna’s Blog ↗
Reddit ↗
Matrix ↗
Help out
Improve metadata
Volunteering & Bounties
Translate ↗
Development
Anna’s Software ↗
Security
DMCA / copyright claims
Alternatives
annas-archive.li ↗
annas-archive.se ↗
annas-archive.org ↗
SLUM [unaffiliated] ↗
SLUM 2 [unaffiliated] ↗
SearchSearch DonateDonate
AccountAccount
Search settings
Order by
Advanced
Add specific search field
Content
Filetype open our viewer
more…
Access
Source
Language
more…
Display
Search settings
Download Journal articles Digital Lending Metadata
Results 1-50 (250+ total)
Crack any product based company no
English [en] · PDF · 5.8MB · 📘 Book (non-fiction) · zlib · Save
base score: 11050.0, final score: 167520.7
DSA PATTERNS no
English [en] · PDF · 1.0MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11053.0, final score: 167517.2
Applied Satisfiability Xiaojuan Liao null, null, null, 2024
null
Read more…
English [en] · PDF · 1.8MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.7
Machine Learning with Python for Everyone Mark E. Fenner
English [en] · PDF · 9.4MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11058.0, final score: 167516.7
Your ad here.
Logic for Computer Science. Lecture Notes Andrzej Szałas Andrzej Szałas, 2002, 2002
Introduction to Logics
Read more…
English [en] · PDF · 0.8MB · 2002 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.7
Bayesian anonymous anonymous, 3, 2024
English [en] · PDF · 42.9MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.7
Algorithms - 1.3 Bags, Queues, and Stacks -2x2 Kevin Wayne, Robert Sedgewick
English [en] · PDF · 3.8MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11058.0, final score: 167516.7
The Little Book of Data Justin Evans Harpercollins Leadership, 2025
Data is not about number crunching. It's about ideas. And when used properly (read: ethically), it is the problem solver of our time.Yet many savvy people seem to be in data denial: they don't think they need to understand data, or it's too complicated, or worse, using it is somehow unethical. Yet as data and AI (just an accelerated way to put data to work) move to the center of professional and civic life, every professional and citizen needs to harness this power.In The Little Book of Data, each chapter illustrates one of the core principles of solving problems with data by featuring an expert who has solved a big problem with data—from the entrepreneur creating a "loneliness score" to the epidemiologist trying to save lives by finding disease "hotspots."The stories are told in a fast-moving, vivid, sometimes comic style, and cover a wide frame of reference from adtech to climate tech, the bubonic plague, tiny submarines, genomics,...
Read more…
English [en] · EPUB · 0.6MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11055.0, final score: 167516.7
Extensible Query Optimizers in Practice Bailu Ding, Vivek Narasayya, Surajit Chaudhuri 2024
The performance of a query crucially depends on the ability of the query optimizer to choose a good execution plan from a large space of alternatives. With the discovery of algebraic transformation rules and the emergence of new application-specific contexts, extensibility has become a key requirement for query optimizers. This monograph describes extensible query optimizers in detail, focusing on the Volcano/Cascades framework used by several database systems including Microsoft SQL Server. We explain the need for extensible query optimizer architectures and how the optimizer navigates the search space efficiently. We then discuss several important transformations that are commonly used in practice. We describe cost estimation, an essential component that the optimizer relies upon to quantitatively compare alternative plans in the search space. We discuss how database systems manage plans over their lifetime as data and workloads change. We conclude with a few open challenges
Read more…
English [en] · PDF · 13.2MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.7
Your ad here.
The Data Science Handbook Field Cady Wiley, 2024
English [en] · PDF · 4.4MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.7
Comprehensive Data Structures and Algorithms in C++ Suresh Kumar Srivastava & Deepali Srivastava BPB Publications, 2023
Data structures and algorithms is an essential subject in computer science studies. It proves to be a great tool in the hands of any software engineer, and also plays a significant role in software design and development. It has become a must-have skill now for many competitions and job interviews in the software industry. The concepts are explained in a step-wise manner and illustrated with numerous figures, text, examples, and immediate code samples, which help in a better understanding of data structures and algorithms with their implementation. The book has more than 500 illustrations, code samples, and problems, along with solutions for exercises. This book provides a comprehensive study of data structures and algorithms, starting with an introduction to time and space complexity analysis using asymptotic notation. It explores arrays and matrices, then progresses to linked lists, stacks (LIFO), and queues (FIFO), emphasizing their respective operations and applications. A detailed chapter on recursion, including base cases and recursive calls, lays the groundwork for understanding binary trees and binary search trees, and graph algorithms such as DFS and BFS. Finally, the book covers storage management, addressing memory allocation, release and garbage collection. This book provides practical C++ implementations and problem-solving exercises to foster a solid understanding of these core computer science concepts. After completion of this book, students will have a good understanding of data structures and algorithms concepts and implementation. Software engineers will be able to provide more effective solutions with the use of appropriate data structures and efficient algorithms.
Read more…
English [en] · PDF · 9.2MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.7
Algorithms for VLSI Design Automation S.H. Gerez
English [en] · PDF · 59.7MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11058.0, final score: 167516.64
Algorithms of Resistance Tiziano Bonini MIT Press
How global workers, influencers, and activists develop tactics of algorithmic resistance by appropriating and repurposing the same algorithms that control our lives.Algorithms are all around us, permeating more and more aspects of our daily lives. While accounts of platform power tend to come across as bleak and monolithic, Algorithms of Resistance shows how people can resist algorithms across a variety of domains. Drawing from rich ethnographic materials and perspectives from both the Global North and South, authors Tiziano Bonini and Emiliano Treré explore how people appropriate and reconfigure algorithms to pursue their objectives in three domains of everyday life: gig work, cultural industries, and politics. They reveal how forms of algorithmic agency and resistance are endemic and mundane and how the platform society is a contested battleground of contrasting forces. Bonini and Treré begin by outlining their key theoretical framework...
Read more…
English [en] · PDF · 9.0MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.64
Innovations in Computing Sushil Kamboj & Pardeep Singh Tiwana CRC Press, 1, 2026
CRC Press/Balkema 是 Taylor & Francis Group 旗下的一家信息业务公司
Read more…
English [en] · PDF · 11.6MB · 2026 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.53
Your ad here.
Comprehensive Data Structures and Algorithms in Java Suresh Kumar Srivastava & Deepali Srivastava BPB Publications, 2025
English [en] · EPUB · 13.2MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.53
Quick Data Structures Matuszek, David; CRC Press LLC, 2025
This book provides an overview of the full range of data structures available to take your programming skills to the next level. It is ideal for software developers, computer science students, and anyone looking to deepen their understanding of how data structures impact the performance and clarity of their programs.
Read more…
English [en] · EPUB · 8.3MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.53
Domain-Driven Design: A pragmatic approach Eduard Ghergu, Ph.D. Leanpub, 2025
Turn complex business challenges into clean, maintainable code with this pragmatic guide to Domain-Driven Design. Designed for software architects and senior developers, this book cuts through theory to deliver: Core DDD patterns (Entities, Aggregates, Bounded Contexts) Clean Architecture integration for scalable systems E-commerce case study with actionable UML diagrams Anti-pattern alerts (like Anemic Domain Models) GitHub examples you can adapt immediatelyPerfect for: Teams adopting microservices Legacy system modernization Developers tired of “business vs. tech” misalignment
Read more…
English [en] · PDF · 3.8MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.53
Automatic Generation Of Algorithms Victor Parada null, null, 1, 2024
In the rapidly evolving domain of computational problem-solving, this book delves into the cutting-edge Automatic Generation of Algorithms (AGA) paradigm, a groundbreaking approach poised to redefine algorithm design for optimization problems. Spanning combinatorial optimization, machine learning, genetic programming, and beyond, it investigates AGA's transformative capabilities across diverse application areas. The book initiates by introducing fundamental combinatorial optimization concepts and NPhardness significance, laying the foundation for understanding AGA's necessity and potential. It then scrutinizes the pivotal Master Problem concept in AGA and the art of modeling for algorithm generation. The exploration progresses with integrating genetic programming and synergizing AGA with evolutionary computing. Subsequent chapters delve into the AGA-machine learning intersection, highlighting their shared optimization foundation while contrasting divergent objectives. The automatic generation of metaheuristics is examined, aiming to develop versatile algorithmic frameworks adaptable to various optimization problems. Furthermore, the book explores applying reinforcement learning techniques to automatic algorithm generation. Throughout, it invites readers to reimagine algorithmic design boundaries, offering insights into AGA's conceptual underpinnings, practical applications, and future directions, serving as an invitation for researchers, practitioners, and enthusiasts in computer science, operations research, artificial intelligence, and beyond to embark on a journey toward computational excellence where algorithms are born, evolved, and adapted to meet ever-changing real-world problem landscapes.
Read more…
English [en] · AZW3 · 3.2MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11055.0, final score: 167516.53
アルゴリズムの学習 George Heineman O'Reilly Media, Inc., 2020
When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively.
Read more…
English [en] · EPUB · 9.4MB · 2020 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.53
Your ad here.
アルゴリズムの学習 George Heineman O'Reilly Media, Inc., 2020
When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively.
Read more…
English [en] · EPUB · 9.4MB · 2020 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.39
Algorithms for Adversarially Robust Deep Learning Alexander Robey v1, 2025
ACKNOWLEDGEMENTThis thesis—and all of the work that I’ve been involved in over the last six years—would nothave been possible without excellent mentorship. The depth of my research and the quality ofmy experience in graduate school is primarily attributable to my Ph.D. advisors, Hamed Hassaniand George J. Pappas, both of whom gave me the extraordinary benefit of their encouragement,feedback, and time. To both of you, all I can say is “Thank you.”I’m grateful for the mentorship of Rene Vidal, Eric Wong, and J. Zico Kolter, who offered invaluable feedback while serving on my doctoral committee. I’m also thankful for the advice that I’vereceived over the years from faculty members both at Penn and in the wider academic world,including Manfred Morari, Nikolai Matni, Stephen Tu, Edgar Dobriban, Chelsea Finn, AlejandroRibeiro, Radoslav Ivanov, and Volkan Cevher. And similarly, thanks to Sayna Ebrahimi and SercanÖ. Arik, who facilitated a wonderful research experience at Google Cloud AI.I had the privilege of working with many others during my Ph.D. I benefited tremendously fromthe mentorship, advice, and collaboration with several fantastic postdocs, including Lars Lindemann, Mahyar Fazlyab, David Hong, Aritra Mitra, Thomas Beckers, Ingvar Ziemann, and NicoloDal Fabbro. I also had memorable and productive collaborations with numerous students, including Patrick Chao, Fabian Latorre, Cian Eastwood, Haimin Hu, Allan Zhou, Fahim Tajwar, HaozeWu, Teruhiro Tagomori, Fengjun Yang, Thomas Waite, Kelly He, Edoardo Debenedetti, MaksymAndriushchenko, Francesco Croce, and Vikash Sehwag. And finally, I would be remiss if I did notacknowledge the many wonderful colleagues at Penn with whom I had many productive conversations, including Arman Adibi, Bruce Lee, Juan Cervino, Behrad Moniri, Thomas Zhang, EshwarRam Arunachaleswaran, Shayan Kiyani, Sima Noorani, Mahdi Sabbaghi, and Eric Lei.
Read more…
English [en] · PDF · 64.5MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.39
RoboBallet: Planning for multirobot reaching with graph neural networks and reinforcement learning Unknown 2025
Modern robotic manufacturing requires collision-free coordination of multiple robots to complete numerous tasks in shared, obstacle-rich workspaces. Although individual tasks may be simple in isolation, automated joint task allocation, scheduling, and motion planning under spatiotemporal constraints remain computationally intractable for classical methods at real-world scales. Existing multiarm systems deployed in industry rely on human intuition and experience to design feasible trajectories manually in a labor-intensive process. To address this challenge, we propose a reinforcement learning (RL) framework to achieve automated task and motion planning, tested in an obstacle-rich environment with eight robots performing 40 reaching tasks in a shared workspace, where any robot can perform any task in any order. Our approach builds on a graph neural network (GNN) policy trained via RL on procedurally generated environments with diverse obstacle layouts, robot configurations, and task distributions. It uses a graph representation of scenes and a graph policy neural network trained through RL to generate trajectories of multiple robots, jointly solving the subproblems of task allocation, scheduling, and motion planning. Trained on large randomly generated task sets in simulation, our policy generalizes zero-shot to unseen settings with varying robot placements, obstacle geometries, and task poses. We further demonstrate that the high-speed capability of our solution enables its use in workcell layout optimization, improving solution times. The speed and scalability of our planner also open the door to capabilities such as fault-tolerant planning and online perception-based replanning, where rapid adaptation to dynamic task sets is required.
Read more…
English [en] · PDF · 1.4MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.39
Social Media Self-Regulation and the Rise of Vaccine Misinformation Ana Santos Rutschman 2021
"This essay examines the main characteristics and shortcomings of mainstream social media responses to vaccine misinformation and disinformation. Parts I and II contextualize the recent expansion of vaccine information and disinformation in the online environment. Part III provides a survey and taxonomy of ongoing responses to vaccine misinformation adopted by mainstream social media. It further notes the limitations of current self-regulatory modes and illustrates these limitations by presenting a short case study on Facebook—the largest social media vehicle for vaccine-specific misinformation, currently estimated to harbor approximately half of the social media accounts linked to vaccine misinformation. Part IV examines potential ways to improve stringency of ongoing modes of self-regulation of vaccine misinformation, as well as the creation of cooperative monitoring and mutual assistance networks dedicated to addressing issues specific to the field of vaccine misinformation."
Read more…
English [en] · PDF · 0.9MB · 2021 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11058.0, final score: 167516.39
Data Structures and Algorithms Interview Questions Bhavana Sangamnerkar Autopublished, 2011
English [en] · PDF · 1.7MB · 2011 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.39
Your ad here.
Advanced C (1986) Herbert Schildt
English [en] · PDF · 21.6MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11058.0, final score: 167516.38
Heap Exploitation Dhaval Kapil GitBook, 1st Edition, 2020
This book on heap exploitation is a guide to understanding the internals of glibc's heap. It also describes, in detail, various attacks possible on the heap structure.
Read more…
English [en] · PDF · 0.8MB · 2020 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.38
Sorting Algorithms and Techniques. Definitive Reference for Developers and Engineers Richard Johnson 2025
“Sorting Algorithms and Techniques””Sorting Algorithms and Techniques” presents a comprehensive, rigorous journey through the foundational and cutting-edge principles of sorting in computer science. Beginning with mathematical preliminaries and theoretical limits, the book explores the essential models and constraints that govern the design of sorting algorithms, delving into formal problem definitions, lower bounds, stability, adaptivity, and the impact of randomization. This solid theoretical grounding is seamlessly connected to a wide survey of sorting strategies, from elementary algorithms such as bubble, selection, and insertion sorts, to sophisticated comparison-based methods like merge sort, quicksort, and introsort, as well as practical hybrid approaches used in today’s leading libraries.Extending far beyond the basics, the text dives into non-comparison-based algorithms, such as counting, bucket, and radix sorts, illuminating their strengths, limitations, and suitability for specialized data types and distributions. Special emphasis is placed on large-scale and high-performance scenarios, with dedicated chapters addressing external, parallel, and distributed sorting, including contemporary techniques for massive data sets and frameworks like MapReduce and Spark. Further, specialized sorting challenges—such as string and compound key sorting, cache-optimized algorithms, sorting for real-time and memory-constrained environments, and techniques for sparse, structured data—are examined in depth, equipping the reader to navigate a broad range of practical and domain-specific requirements.Recognizing the complexity of modern hardware and software ecosystems, the book addresses algorithm engineering, common implementation pitfalls, profiling, and formal verification strategies. It concludes with forward-looking discussions of privacy-preserving sorting, hardware acceleration, quantum algorithms, and current research frontiers. Exhaustive yet accessible, “Sorting...
Read more…
English [en] · EPUB · 2.6MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.38
Algorithms of Resistance Tiziano Bonini MIT Press
How global workers, influencers, and activists develop tactics of algorithmic resistance by appropriating and repurposing the same algorithms that control our lives.Algorithms are all around us, permeating more and more aspects of our daily lives. While accounts of platform power tend to come across as bleak and monolithic, Algorithms of Resistance shows how people can resist algorithms across a variety of domains. Drawing from rich ethnographic materials and perspectives from both the Global North and South, authors Tiziano Bonini and Emiliano Treré explore how people appropriate and reconfigure algorithms to pursue their objectives in three domains of everyday life: gig work, cultural industries, and politics. They reveal how forms of algorithmic agency and resistance are endemic and mundane and how the platform society is a contested battleground of contrasting forces. Bonini and Treré begin by outlining their key theoretical framework...
Read more…
English [en] · EPUB · 6.7MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.38
DSA - Real World Examples no
English [en] · PDF · 0.5MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11048.0, final score: 167516.38
Your ad here.
Problem-solving with algorithms and data structures using Rust Shieber
To provide readers with a clear understanding of the structure of the book and to help advanced usersselect chapters, we have summarized the contents of the entire book below. The book is divided into ten chapters.
Read more…
English [en] · PDF · 2.2MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11061.0, final score: 167516.38
Algorithms in C Robert Sedgewick 2004
English [en] · PDF · 33.3MB · 2004 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.05
Efficient Algorithm Efficient Algorithm Design: Unlock the power of algorithms to optimize computer programming Masoud Makrehchi Packt Publishing Pvt. Ltd., 2024
Unlock the power of algorithms to optimize computer programming
Read more…
English [en] · EPUB · 3.3MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.05
Algorithms Panos Louridas MIT Press, 2020
In the tradition of Real World Algorithms: A Beginner's Guide, Panos Louridas is back to introduce algorithms in an accessible manner, utilizing various examples to explain not just what algorithms are but how they work.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning. Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader. Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum.
Read more…
English [en] · EPUB · 3.9MB · 2020 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.05
Foundations of Algorithms Richard Neapolitan Jones & Bartlett Learning, 2014
English [en] · PDF · 19.4MB · 2014 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.05
Your ad here.
Mastering Algorithms with Perl sa 2001
English [en] · PDF · 6.4MB · 2001 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.05
Configuration Scrubbing Architectures for High-Reliability FPGA Systems Aaron Gerald Stoddard Brigham Young University, 2015
Field Programmable Gate Arrays (FPGAs) are being used more frequently in space applications because of their reconf i gurability and intensive processing capabilities. FPGAs in environments like space are susceptible to ionizing radiation which can cause Single Event Upsets (SEUs) in the FPGA’s conf i guration memory. These upsets may cause the pro-grammed user design on the FPGA to deviate from its normal behavior. Space missions cannot af f ord to allow important data processing applications to become corrupted due to these radiation upsets.Conf i guration scrubbing is an upset mitigation technique that detects and corrects upsets in an FPGA’s conf i guration memory. Conf i guration scrubbing periodically moni-tors an FPGA’s conf i guration memory utilizing mechanisms such as Error Correction Codes (ECCs), Cyclic Redundancy Checks (CRCs), a protected golden f i le, and partial reconf i gu-ration to detect and correct upset memory bits. This work presents improved Xilinx 7-Series conf i guration scrubbing architectures that achieve minimal hardware footprints, competitive performance metrics, and robust detection and correction capabilities.The two principal scrubbing architectures presented in this work are the readback and hybrid scrubbers which detect and correct Single Bit Upsets (SBUs) and Multi-Bit Upsets (MBUs). Harnessing the performance advantages granted by the 7-Series internal Readback CRC scan, a hybrid scrubber built in software for the Zynq XZC07020 FPGA has been measured to correct SBUs in 8.024 ms, even-numbered MBUs in 13.38 ms, and odd-numbered MBUs in 21.40 ms. It can also perform a full readback scrub of the entire device in under two seconds. These scrubbing architectures were validated in radiation beam tests, where one of the architectures corrected MBUs as large as sixteen bits in a single frame.
Read more…
English [en] · PDF · 5.8MB · 2015 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167516.05
Comprehensive Data Structures and Algorithms in Java Suresh Kumar Srivastava, Deepali Srivastava BPB Publications, 2025
English [en] · PDF · 9.1MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.05
SQL for Data Analysis: Harnessing the Power of SQL for Insightful Data Exploration -- 2024
English [en] · PDF · 63.4MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.05
Decoupled Django: Understand and Build Decoupled Django Architectures for JavaScript Front-ends Valentino Gagliardi Apress, 2021
English [en] · EPUB · 1.9MB · 2021 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.05
Your ad here.
Django 5 Cookbook Clara Stein 2024
English [en] · PDF · 0.8MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11055.0, final score: 167516.05
From Algorithms to Thinking Machines Talia, Domenico; Morgan & Claypool Publishers, 2023
English [en] · EPUB · 2.0MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.05
Algorithms and Data Sturctures(bookmarks) Niklaus Wirth Oberon version, 2012
English [en] · PDF · 2.5MB · 2012 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.05
Hallo .NET 8.0: Practical ASP.NET Core Minimal API Agus Kurniawan
English [en] · PDF · 6.4MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11058.0, final score: 167516.05
Data Science for Beginners: Comprehensive Guide to Most Important Basics in Data Science Campbell, Alex 2021
English [en] · PDF · 2.2MB · 2021 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167516.05
Your ad here.
Grokking Algorithms, Second Edition Aditya Y. Bhargava Manning Publications Co., 2, 2024
English [en] · EPUB · 23.6MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.05
API Design Patterns John J. (JJ) Geewax Manning Publications, 2021
English [en] · EPUB · 3.1MB · 2021 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167516.05
Data Mining and Predictive Analytics for Business Decisions Andres Fortino Mercury Learning and Information
With many recent advances in data science, we have many more tools and techniques available for data analysts to extract information from data sets. This book will assist data analysts to move up from simple tools such as Excel for descriptive analytics to answer more sophisticated questions using machine learning. Most of the exercises use R and Python, but rather than focus on coding algorithms, the book employs interactive interfaces to these tools to perform the analysis. Using the CRISP-DM data mining standard, the early chapters cover conducting the preparatory steps in data mining: translating business information needs into framed analytical questions and data preparation. The Jamovi and the JASP interfaces are used with R and the Orange3 data mining interface with Python. Where appropriate, Voyant and other open-source programs are used for text analytics. The techniques covered in this book range from basic descriptive statistics, such as summarization and tabulation,...
Read more…
English [en] · PDF · 23.9MB · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11063.0, final score: 167516.05
Data Structures and Algorithms in JavaTM Michael T. Goodrich & Roberto Tamassia & Michael H. Goldwasser 2013
English [en] · PDF · 9.9MB · 2013 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11060.0, final score: 167515.98
Grokking Algorithms, Second Edition Aditya Y. Bhargava Manning Publications Co., 22, 2024
English [en] · EPUB · 23.6MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11062.0, final score: 167515.98
Your ad here.
Bio-Inspired Algorithms Sándor Szénási, Gábor Kertész MDPI, Special Issue Reprints, 2025
The goal for this Special Issue on "Bio-Inspired Algorithms" was to seek original research papers about novel bio-inspired methods, analysis of already-existing techniques, or high-level practical applications from the field of computer science or any interdisciplinary field. We have accepted manuscripts discussing the following: • evolutional (Genetic Algorithms, NSGA, etc.), • swarm-intelligence-based (Particle Swarm Optimization, Ant Colony Optimization, Fireworks Algorithm, etc.), • brain-inspired computing (Neural Networks, Deep Learning, etc.) • methods applied in any kind of research project (image processing, natural language processing, general optimization, physical simulations, etc.).
Read more…
English [en] · PDF · 51.6MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167515.98
Previous 1 2 3 4 5 Next
Previous 1 2 … 5 Next
Anna’s Archive
Home
Search
Donate
🧬 SciDB
FAQ
Account
Log in / Register
Account
Public profile
Downloaded files
My donations
Referrals
Explore
Activity
Codes Explorer
ISBN Visualization ↗
Community Projects ↗
Open data
Datasets
Torrents
LLM data
Stay in touch
Contact email
Anna’s Blog ↗
Reddit ↗
Matrix ↗
Help out
Improve metadata
Volunteering & Bounties
Translate ↗
Development
Anna’s Software ↗
Security
DMCA / copyright claims
Alternatives
annas-archive.li ↗
annas-archive.se ↗
annas-archive.org ↗
SLUM [unaffiliated] ↗
SLUM 2 [unaffiliated] ↗