George T. Heineman on O'Reilly Broadcasttag:broadcast.oreilly.com,2008-08-07://532009-06-18T19:00:00ZMovable Type Pro 4.21-enMay Column: Multi-threaded Algorithm Implementationstag:broadcast.oreilly.com,2009://53.371582009-06-18T19:00:00Z2009-06-18T19:00:00ZMany of the algorithms presented in the book, Algorithms in a Nutshell, can take advantage of multi-core chips by using threads. In this column we explore effective uses of threads and report on situations where using threads will not help. George T. Heineman
Many of the algorithms presented in the book, Algorithms in a Nutshell, can take advantage of multi-core chips by using threads. In this column we explore effective uses of threads and report on situations where using threads will not help.
April Column: Computational Geometrytag:broadcast.oreilly.com,2009://53.362172009-05-13T17:09:33Z2009-05-13T17:09:33ZComputational Geometry is the study of geometric algorithms and the data structures that enable their efficient implementation. We present algorithms that solve the Line Segment Intersection problem and describe challenges in validating their implementation. This is the sixth of a series of monthly columns in the blog associated with the Algorithms in a Nutshell book, published October 2008 by O'Reilly Media, Inc.George T. Heineman
Computational Geometry is the study of geometric algorithms and the data structures that enable their efficient implementation. We present algorithms that solve the Line Segment Intersection problem and describe challenges in validating their implementation. This is the sixth of a series of monthly columns in the blog associated with the Algorithms in a Nutshell book, published October 2008 by O'Reilly Media, Inc.
March Column: Network Flow Algorithmstag:broadcast.oreilly.com,2009://53.357272009-04-06T19:00:00Z2009-04-06T19:00:00ZThis is the fifth of a series of monthly columns in the blog associated with the Algorithms in a Nutshell book. Many real-world transportation networks (i.e., highways, power grids, water subsystems) can be represented as Flow Networks. The Ford-Fulkerson technique describes an approach to solve numerous cost optimization problems. George T. Heineman
This is the fifth of a series of monthly columns in the blog associated with the Algorithms in a Nutshell book. Many real-world transportation networks (i.e., highways, power grids, water subsystems) can be represented as Flow Networks. The Ford-Fulkerson technique describes an approach to solve numerous cost optimization problems.
February Column: Improving Performance Of Algorithmstag:broadcast.oreilly.com,2009://53.354322009-03-01T04:00:00Z2009-03-01T04:00:00ZYou need two different techniques for optimizing the performance of an algorithm. Sometimes you improve upon the algorithm; sometimes you improve the way the algorithm is implemented. Both techniques are essential to applying algorithms properly. In this column we explain how to improve on the algorithm from last month. This task is quite common, really, in both algorithm design and in programming. We will describe our attempt to improve the performance of the Java-based Staged Deepening algorithm introduced last month for solving FreeCell. We also explain why certain optimizations were made when we implemented Prim's Algorithm for computing the Minimum Spanning Tree for a graph.George T. Heineman
You need two different techniques for optimizing the performance of an algorithm. Sometimes you improve upon the algorithm; sometimes you improve the way the algorithm is implemented. Both techniques are essential to applying algorithms properly. In this column we explain how to improve on the algorithm from last month. This task is quite common, really, in both algorithm design and in programming. We will describe our attempt to improve the performance of the Java-based Staged Deepening algorithm introduced last month for solving FreeCell. We also explain why certain optimizations were made when we implemented Prim's Algorithm for computing the Minimum Spanning Tree for a graph.
January Column: Algorithm to Solve FreeCell Solitaire Gamestag:broadcast.oreilly.com,2009://53.347202009-01-17T20:00:00Z2009-01-17T20:00:00ZWe describe how to use recursive backtracking to solve a search problem. We design a staged deepening algorithm to solve FreeCell solitaire games. This material is not drawn from the book, but rather helps to place the graph searching algorithms in a better context.George T. Heineman
We describe how to use recursive backtracking to solve a search problem. We design a staged deepening algorithm to solve FreeCell solitaire games. This material is not drawn from the book, but rather helps to place the graph searching algorithms in a better context.
December Column: Searching Algorithmstag:broadcast.oreilly.com,2008://53.344612008-12-04T18:36:00Z2008-12-04T18:36:00ZIn the second monthly column for the blog associated with the Algorithms in a Nutshell, we investigate searching algorithms and reaffirm the ability for hash-based search to provide an efficient implementation.George T. Heineman
In the second monthly column for the blog associated with the Algorithms in a Nutshell, we investigate searching algorithms and reaffirm the ability for hash-based search to provide an efficient implementation.
November Column: Welcome to Algorithms in a Nutshelltag:broadcast.oreilly.com,2008://53.337062008-10-26T00:15:29Z2008-10-26T00:15:29ZThis is the first of a series of monthly columns in the blog associated with the Algorithms in a Nutshell, published October 2008 by O'Reilly Media, Inc. All algorithms are fully implemented and available in the online code repository associated with the book.George T. Heineman
This is the first of a series of monthly columns in the blog associated with the Algorithms in a Nutshell, published October 2008 by O'Reilly Media, Inc. All algorithms are fully implemented and available in the online code repository associated with the book.