Sciweavers

102 search results - page 7 / 21
» On Acyclicity of Games with Cycles
Sort
View
JGT
2008
103views more  JGT 2008»
13 years 7 months ago
Game coloring the Cartesian product of graphs
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
Xuding Zhu
CG
2008
Springer
13 years 9 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
DIGRA
2005
Springer
14 years 27 days ago
Girls Creating Games: Challenging Existing Assumptions about Game Content
In a reinforcing cycle, few females create games and fewer girls than boys play games. In this paper, we increase our understanding of what girls like about games and gaming by de...
Jill Denner, Steven Bean, Linda L. Werner
MICRO
1998
IEEE
91views Hardware» more  MICRO 1998»
13 years 11 months ago
Effective Cluster Assignment for Modulo Scheduling
Clustering is one solution to the demand for wideissue machines and fast clock cycles because it allows for smaller, less ported register files and simpler bypass logic while rema...
Erik Nystrom, Alexandre E. Eichenberger
ICTAI
2006
IEEE
14 years 1 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...