Sciweavers

713 search results - page 99 / 143
» Using information about functions in selecting test cases
Sort
View
CEC
2007
IEEE
15 years 6 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
ECAL
1995
Springer
15 years 3 months ago
Evolving Artificial Neural Networks that Develop in Time
Although recently there has been an increasing interest in studing genetically-based development using Artificial Life models, the mapping of the genetic information into the phen...
Stefano Nolfi, Domenico Parisi
AAAI
2008
15 years 2 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
SIGMOD
2000
ACM
85views Database» more  SIGMOD 2000»
15 years 4 months ago
Finding Replicated Web Collections
Many web documents (such as JAVA FAQs) are being replicated on the Internet. Often entire document collections (such as hyperlinked Linux manuals) are being replicated many times....
Junghoo Cho, Narayanan Shivakumar, Hector Garcia-M...
INFOCOM
2008
IEEE
15 years 6 months ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...