Sciweavers

1650 search results - page 216 / 330
» The HOM problem is decidable
Sort
View
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 10 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
ASP
2003
Springer
15 years 10 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri
ATAL
2003
Springer
15 years 10 months ago
Resource allocation games with changing resource capacities
In this paper we study a class of resource allocation games which are inspired by the El Farol Bar problem. We consider a system of competitive agents that have to choose between ...
Aram Galstyan, Shashikiran Kolar, Kristina Lerman
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 10 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 9 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...