828 search results - page 79 / 166 » Bounded Hairpin Completion |
SIROCCO
2000
13 years 11 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
ENTCS
2007
13 years 10 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
MP
2006
13 years 10 months ago
2006
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...