5981 search results - page 297 / 1197 » time 2006 |
193
click to vote
JCT
2010
15 years 5 months ago
2010
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
183
click to vote
JOLLI
2010
15 years 5 months ago
2010
This paper surveys the interface between the two major logical trends that describe agents’ intelligent interaction over time: dynamic epistemic logic (DEL) and epistemic tempora...
175
click to vote
JVCA
2010
15 years 5 months ago
2010
In a context of interactive applications, adapting motion capture data to new situations or producing variants of them are known as non trivial tasks. We propose an original metho...
128
click to vote
MANSCI
2010
15 years 5 months ago
2010
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
195
click to vote
RSA
2010
15 years 5 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...