Sciweavers

350 search results - page 27 / 70
» Branching Programs for Tree Evaluation
Sort
View
EUROSYS
2009
ACM
14 years 4 months ago
Pointless tainting?: evaluating the practicality of pointer tainting
This paper evaluates pointer tainting, an incarnation of Dynamic Information Flow Tracking (DIFT), which has recently become an important technique in system security. Pointer tai...
Asia Slowinska, Herbert Bos
GECCO
2005
Springer
14 years 1 months ago
Evaluating GP schema in context
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
Hammad Majeed, Conor Ryan, R. Muhammad Atif Azad
COR
2007
87views more  COR 2007»
13 years 7 months ago
An exact algorithm for generating homogenous T-shape cutting patterns
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
Yaodong Cui
CISIS
2009
IEEE
14 years 2 months ago
Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahar...
POPL
2012
ACM
12 years 3 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...