Sciweavers

299 search results - page 11 / 60
» Generalizing Automatically Generated Selectional Patterns
Sort
View
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
14 years 8 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
AAAI
2007
13 years 10 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
IFM
2005
Springer
14 years 1 months ago
Generating Path Conditions for Timed Systems
We provide an automatic method for calculating the path condition for programs with real time constraints. This method can be used for the semiautomatic verification of a unit of ...
Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros...
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 25 days ago
The Effect of Binary Matching Rules in Negative Selection
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
Fabio A. González, Dipankar Dasgupta, Jonat...
FPL
2007
Springer
99views Hardware» more  FPL 2007»
13 years 11 months ago
Disjoint Pattern Enumeration for Custom Instructions Identification
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
Pan Yu, Tulika Mitra