3211 search results - page 465 / 643 » On the Grundy Number of a Graph |
159
click to vote
SIGECOM
2004
ACM
15 years 12 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
176
click to vote
APN
2004
Springer
15 years 12 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
191
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
159
click to vote
FORMATS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
192
click to vote
ICCS
2004
Springer
15 years 12 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...