Sciweavers

1972 search results - page 296 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
173
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 4 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
187
Voted
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
14 years 4 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
PLDI
2009
ACM
15 years 11 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
SIGPLAN
2002
15 years 4 months ago
Write barrier removal by static analysis
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
Karen Zee, Martin C. Rinard
NDSS
2009
IEEE
15 years 11 months ago
Scalable, Behavior-Based Malware Clustering
Anti-malware companies receive thousands of malware samples every day. To process this large quantity, a number of automated analysis tools were developed. These tools execute a m...
Ulrich Bayer, Paolo Milani Comparetti, Clemens Hla...