Sciweavers

406 search results - page 40 / 82
» Identifying Codes and Covering Problems
Sort
View
IEEEPACT
2009
IEEE
14 years 3 months ago
Chainsaw: Using Binary Matching for Relative Instruction Mix Comparison
With advances in hardware, instruction set architectures are undergoing continual evolution. As a result, compilers are under constant pressure to adapt and take full advantage of...
Tipp Moseley, Dirk Grunwald, Ramesh Peri
IWPC
2006
IEEE
14 years 2 months ago
Dynamic Analysis of Software Systems using Execution Pattern Mining
Software system analysis for extracting system functionality remains as a major problem in the reverse engineering literature and the early approaches mainly rely on static proper...
Hossein Safyallah, Kamran Sartipi
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 2 months ago
Dormant program nodes and the efficiency of genetic programming
In genetic programming, there is a tendency for individuals in a population to accumulate fragments of code – often called introns – which are redundant in the fitness evaluat...
David Jackson
USM
2000
14 years 7 days ago
Trade-offs in a Secure Jini Service Architecture
Jini is an infrastructure built on top of the mobile code facilities of the Java programming language enabling clients and services to spontaneously engage in arbitrary usage scena...
Peer Hasselmeyer, Roger Kehr, Marco Voß
IS
2008
13 years 8 months ago
Integration of complex archeology digital libraries: An ETANA-DL experience
In this paper, we formalize the digital library (DL) integration problem and propose an overall approach based on the 5S (streams, structures, spaces, scenarios, and societies) fr...
Rao Shen, Naga Srinivas Vemuri, Weiguo Fan, Edward...