Parallelizing N-Queens with the Intel Parallel Composer
Two queens can attack each others when they are placed on the same horizontal row, vertical column or in one of (2*(2*n - 1)) possible diagonals. For example, on an 8x8 board, there are 92 distinct solutions.
Ternary Search Trees - Dr. Dobb's
1998年4月1日 · In this article, we'll examine ternary search trees, which combine the time efficiency of digital tries with the space efficiency of binary search trees. The resulting structure is faster than hashing for many typical search problems, and supports a broader range of useful problems and operations. Ternary searches are faster than hashing and ...
Apple Acquires Lisp Company | Dr Dobb's
Apple Acquires Lisp Company. By Michael Swaine, April 01, 1989 This month Mike takes a second look at superlinearity and suggests/proposes/demands that computer science curricula begin with courses in -- you guessed it -- programming paradigms.
Anatomy of a Stack Smashing Attack and How GCC Prevents It
2012年6月19日 · Permalink. Anatomy of a Stack Smashing Attack and How GCC Prevents It. By Oliver Mueller, June 19, 2012. The use of special prologues and epilogues around functions can easily detect attacks that rely on stack overflows. Here is how "stack smashing" is actually performed and how its occurrence is detected. 1   2 3 Next.
Fast IP Routing with LC-Tries - Dr. Dobb's
1998年8月1日 · The trie is a general-purpose data structure for storing strings. The idea behind it is simple: Each string is represented by a leaf in a tree structure, and the value of the string corresponds to the path from the root of the tree to the leaf. The binary strings in the routing table in Figure 1 correspond to the trie in Figure 2(a).
State Machines & User Interfaces | Dr Dobb's
2003年1月1日 · State Machines & User Interfaces. By Brian O'Byrne, January 01, 2003 JStateMachine is a software project built to control user interfaces by keeping them within the bounds of a statechart, letting you produce MVC-like View and Controller classes.
Understanding Oracle Attacks on Information Services | Dr Dobb's
By Jason Coombs, December 02, 2004. Understanding Oracle Attacks on Information Services. An oracle attack analyzes each interaction with a system to extract hidden data or implementation details. Defending against oracle attacks is easy but only if you see vulnerability in the first place. The concept of an oracle attack originates from the ...
Algorithm Alley: Fast String Searching with Suffix Trees
The suffix trees Mark describes here precalculate data structures for fast string searches. To illustrate suffix trees, he presents a program that reads in a string of text from standard input, then builds a tree.
Transaction Processing | Dr Dobb's
By preserving the integrity of whole transactions, not just the elements thereof, transaction processing ensures the integrity of data at the conceptual level in the face of catastrophic failure.
The Rete Matching Algorithm | Dr Dobb's
2002年12月5日 · The Rete algorithm stores the conditions of all the production rules in a tree-structured sorting network. The Rete algorithm complies the network from the list of production rules and then keeps the network current as rules are added and deleted from the lists. To see how that works, let's look at some rules in a candy company's expert system.