Results 1  10
of
36,764
Combinatorial Game Theory Foundations Applied to Digraph Kernels
 Electronic Journal Combinatorics
, 1996
"... Known complexity facts: the decision problem of the existence of a kernel in a digraph G =( V,E) is NPcomplete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #Pcomplete even for this restricted class of digraphs. In the opposite direc ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
direction, we construct game theory tools, of independent interest, concerning strategies in the presence of draw positions, to show how to partition V ,inO ( E ) time, into 3 subsets S 1 ,S 2 ,S 3 , such that S 1 lies in all the kernels; S 2 lies in the complements of all the kernels; and on S 3
On Combinatorial Game Theory Foundations with Applications to Digraph Kernels
, 1996
"... . Known facts: the decision problem of the existence of a kernel in a digraph G = (V; E) is NPcomplete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #Pcomplete even for this restricted class of digraphs. We construct game theory tool ..."
Abstract
 Add to MetaCart
. Known facts: the decision problem of the existence of a kernel in a digraph G = (V; E) is NPcomplete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #Pcomplete even for this restricted class of digraphs. We construct game theory
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Consensus and cooperation in networked multiagent systems
 PROCEEDINGS OF THE IEEE
"... This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An overview of ..."
Abstract

Cited by 772 (2 self)
 Add to MetaCart
of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems
Results 1  10
of
36,764