Sciweavers

9532 search results - page 36 / 1907
» Logic, Graphs, and Algorithms
Sort
View
JGAA
2007
123views more  JGAA 2007»
13 years 11 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
14 years 7 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
APN
2004
Springer
14 years 4 months ago
LTL Model Checking for Modular Petri Nets
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
Timo Latvala, Marko Mäkelä
CADE
2001
Springer
14 years 11 months ago
RACER System Description
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized s...
Ralf Möller, Volker Haarslev
CADE
1999
Springer
14 years 3 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies