1683 search results - page 287 / 337 » Game Theory Basics |
161
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
146
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
165
click to vote
IBERAMIA
2004
Springer
15 years 11 months ago
2004
Springer
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
150
click to vote
KES
2004
Springer
15 years 11 months ago
2004
Springer
A "chance" is an event or a situation significant for making a decision in a complex environment. Since we organized a session of Chance Discovery in KES 2000, the basic...
164
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...