Sciweavers

205 search results - page 33 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
VLDB
2007
ACM
164views Database» more  VLDB 2007»
14 years 8 months ago
A new intrusion detection system using support vector machines and hierarchical clustering
Whenever an intrusion occurs, the security and value of a computer system is compromised. Network-based attacks make it difficult for legitimate users to access various network ser...
Latifur Khan, Mamoun Awad, Bhavani M. Thuraisingha...
ISSTA
2012
ACM
11 years 11 months ago
Swarm testing
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
Alex Groce, Chaoqiang Zhang, Eric Eide, Yang Chen,...
BMCBI
2011
13 years 5 days ago
Gene set analysis for longitudinal gene expression data
Background: Gene set analysis (GSA) has become a successful tool to interpret gene expression profiles in terms of biological functions, molecular pathways, or genomic locations. ...
Ke Zhang, Haiyan Wang, Arne C. Bathke, Solomon W. ...
INTEGRATION
2006
82views more  INTEGRATION 2006»
13 years 8 months ago
On whitespace and stability in physical synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible ...
Saurabh N. Adya, Igor L. Markov, Paul G. Villarrub...
GECCO
2009
Springer
14 years 13 days ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom