446 search results - page 25 / 90 » A Combinatorial Theorem for Trees |
106
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
132
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
126
Voted
ITC
2003
IEEE
15 years 7 months ago
2003
IEEE
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
111
click to vote
AAAI
2004
15 years 3 months ago
2004
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
SODA
1996
ACM
15 years 3 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...