Sciweavers

1845 search results - page 140 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
COLT
1993
Springer
15 years 5 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
CCGRID
2009
IEEE
15 years 8 months ago
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
Xiaofeng Wang, Rajkumar Buyya, Jinshu Su
113
Voted
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
15 years 5 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
ICDCS
2007
IEEE
15 years 8 months ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 4 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala