6045 search results - page 861 / 1209 » Computable Linearizations of Well-partial-orderings |
161
click to vote
WIKIS
2005
ACM
16 years 12 days ago
2005
ACM
In this article we examine the integration of communities of practice supported by a wiki into work processes. Linear structures are often inappropriate for the execution of knowl...
183
click to vote
EUROCAST
2005
Springer
16 years 11 days ago
2005
Springer
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
174
click to vote
FMCO
2005
Springer
16 years 11 days ago
2005
Springer
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, Universi...
168
Voted
GD
2005
Springer
16 years 11 days ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
170
click to vote
GD
2005
Springer
16 years 11 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...