Sciweavers

1933 search results - page 181 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
MEMETIC
2010
311views more  MEMETIC 2010»
14 years 11 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
JMLR
2012
13 years 6 months ago
PAC-Bayes-Bernstein Inequality for Martingales and its Application to Multiarmed Bandits
We develop a new tool for data-dependent analysis of the exploration-exploitation trade-off in learning under limited feedback. Our tool is based on two main ingredients. The fi...
Yevgeny Seldin, Nicolò Cesa-Bianchi, Peter ...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 5 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
TWC
2010
14 years 11 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
IPPS
1996
IEEE
15 years 8 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá