Sciweavers

1845 search results - page 261 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
IPL
2006
110views more  IPL 2006»
13 years 8 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
VLSID
2005
IEEE
123views VLSI» more  VLSID 2005»
14 years 8 months ago
Variance Reduction in Monte Carlo Capacitance Extraction
In this article we address efficiency issues in implementation of Monte Carlo algorithm for 3D capacitance extraction. Error bounds in statistical capacitance estimation are discus...
Shabbir H. Batterywala, Madhav P. Desai
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
14 years 2 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
14 years 2 months ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
AI
2003
Springer
14 years 1 months ago
Iterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Kevin Smyth, Holger H. Hoos, Thomas Stützle