Sciweavers

4378 search results - page 201 / 876
» On the Complexity of Ordered Colourings
Sort
View
WSC
2004
15 years 8 months ago
Peeking Into the Black Box: Some Art and Science to Visualizing Agent-Based Models
This paper explores current metaphors for visualizing agent-based models. Metaphors include grid, network, ndimensional cubes and landscape visualization techniques. A final secti...
Stephen M. Guerin
ITA
2008
119views Communications» more  ITA 2008»
15 years 6 months ago
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
Aleksandrs Belovs
MST
2008
141views more  MST 2008»
15 years 6 months ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
COLING
2002
15 years 6 months ago
Computation of Modifier Scope in NP by a Language-neutral Method
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of s...
Richard Campbell
EDBTW
2010
Springer
15 years 5 months ago
Using web-based personalization on spatial data warehouses
Spatial data warehouses (SDW) rely on extended multidimensional (MD) models in order to provide decision makers with appropriate structures to intuitively analyse spatial data. Se...
Octavio Glorio, Jose-Norberto Mazón, Irene ...