2492 search results - page 282 / 499 » On the General Signature Trees |
172
Voted
SIGECOM
2006
ACM
16 years 2 days ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
165
click to vote
IDEAL
2005
Springer
15 years 11 months ago
2005
Springer
Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the ...
153
click to vote
PASTE
2004
ACM
15 years 11 months ago
2004
ACM
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
175
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
142
click to vote
PADS
1999
ACM
15 years 10 months ago
1999
ACM
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...