20 search results - page 3 / 4 » Discrete relations on abstract simplicial complexes |
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
ACTA
2007
13 years 7 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
CONSTRAINTS
2008
13 years 7 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
NCA
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper we address the challenge of realizing full-body behaviors in scalable modular robots. We present an experimental study of a biologically inspired approach to organize...
IJCAI
2007
13 years 8 months ago
2007
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...