1552 search results - page 248 / 311 » On the Complexity of Constant Propagation |
GECCO
2008
Springer
15 years 28 days ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
102
click to vote
ICML
2010
IEEE
15 years 28 days ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
RECSYS
2010
ACM
15 years 1 days ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
SIGMOD
2010
ACM
15 years 1 days ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
118
click to vote
GLOBECOM
2008
IEEE
15 years 8 hour ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...