Balint Tillman

Learn More
Controlling units in real-time strategy (RTS) games is a challenging problem in Artificial Intelligence (AI) as these games are fast-paced with simultaneous moves and massive branching factors. This paper presents two extensions to the algorithm UCT Considering Durations (UCTCD) for finding optimal sequences of actions to units engaged in combat using the(More)
In networking research, it is often desirable to generate synthetic graphs with certain properties. In this paper, we present a new algorithm, 2K_Simple, for exact construction of simple graphs with a target joint degree matrix (JDM). We prove that the algorithm constructs exactly the target JDM and that its running time is linear in the number of edges.(More)
We study the problem of generating synthetic graphs that resemble real-world directed graphs in terms of their degree correlations. In order to capture degree correlation specifically for directed graphs, we define <i>directed 2K (D2K)</i> as those graphs with a given directed degree sequence (DDS) and a given target joint degree and attribute matrix(More)
  • 1