Sciweavers

13841 search results - page 2369 / 2769
» Algorithms and Constraint Programming
Sort
View
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
15 years 6 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
156
Voted
SIGCOMM
2010
ACM
15 years 5 months ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
GLOBECOM
2008
IEEE
15 years 5 months ago
Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this...
Vahid Shah-Mansouri, Vincent W. S. Wong
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 5 months ago
Detecting Botnets Through Log Correlation
Botnets, which consist of thousands of compromised machines, can cause significant threats to other systems by launching Distributed Denial of Service (DDoS) attacks, keylogging, a...
Yousof Al-Hammadi, Uwe Aickelin
COR
2008
105views more  COR 2008»
15 years 5 months ago
Minimizing the object dimensions in circle and sphere packing problems
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
Ernesto G. Birgin, F. N. C. Sobral
« Prev « First page 2369 / 2769 Last » Next »