Sciweavers

406 search results - page 21 / 82
» Identifying Codes and Covering Problems
Sort
View
INFSOF
2002
153views more  INFSOF 2002»
13 years 8 months ago
Analyzing cloning evolution in the Linux kernel
Identifying code duplication in large multi-platform software systems is a challenging problem. This is due to a variety of reasons including the presence of high-level programmin...
Giuliano Antoniol, Umberto Villano, Ettore Merlo, ...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 18 days ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
ICLP
1997
Springer
14 years 26 days ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
MICRO
2003
IEEE
142views Hardware» more  MICRO 2003»
14 years 2 months ago
Hardware Support for Control Transfers in Code Caches
Many dynamic optimization and/or binary translation systems hold optimized/translated superblocks in a code cache. Conventional code caching systems suffer from overheads when con...
Ho-Seop Kim, James E. Smith
RECOMB
2003
Springer
14 years 9 months ago
Towards optimally multiplexed applications of universal DNA tag systems
We study a design and optimization problem that occurs, for example, when single nucleotide polymorphisms (SNPs) are to be genotyped using a universal DNA tag array. The problem o...
Amir Ben-Dor, Tzvika Hartman, Benno Schwikowski, R...