Sciweavers

861 search results - page 18 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
CCS
2007
ACM
13 years 11 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 6 days ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
BMCBI
2010
108views more  BMCBI 2010»
13 years 7 months ago
Confronting two-pair primer design for enzyme-free SNP genotyping based on a genetic algorithm
Background: Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) method produces allelespecific DNA bands of different lengths by adding four designed primers an...
Cheng-Hong Yang, Yu-Huei Cheng, Li-Yeh Chuang, Hsu...
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
ICTAC
2004
Springer
14 years 29 days ago
Real Time Reactive Programming in Lucid Enriched with Contexts
Abstract. We present a synchronous approach to real-time reactive programming in Lucid enriched with contexts as first class objects. The declarative intensional approach allows r...
Kaiyu Wan, Vasu S. Alagar, Joey Paquet