Sciweavers

707 search results - page 77 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
ALMOB
2006
155views more  ALMOB 2006»
13 years 9 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
CAV
2007
Springer
121views Hardware» more  CAV 2007»
14 years 3 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
IEEEPACT
2006
IEEE
14 years 3 months ago
Complexity-based program phase analysis and classification
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
Chang-Burm Cho, Tao Li
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
14 years 2 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano
SIGSOFT
2009
ACM
14 years 9 months ago
Asserting and checking determinism for multithreaded programs
The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing p...
Jacob Burnim, Koushik Sen