Sciweavers

4372 search results - page 542 / 875
» Algorithmic Theories of Everything
Sort
View
LCTRTS
2009
Springer
16 years 1 months ago
Live-range unsplitting for faster optimal coalescing
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
Sandrine Blazy, Benoît Robillard
NDSS
2008
IEEE
16 years 1 months ago
Limits of Learning-based Signature Generation with Adversaries
Automatic signature generation is necessary because there may often be little time between the discovery of a vulnerability, and exploits developed to target the vulnerability. Mu...
Shobha Venkataraman, Avrim Blum, Dawn Song
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
16 years 29 days ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
PODC
2005
ACM
16 years 11 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
COLT
1997
Springer
15 years 11 months ago
On-line Learning and the Metrical Task System Problem
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
Avrim Blum, Carl Burch