934 search results - page 84 / 187 » exact 2007 |
144
click to vote
PDP
2007
IEEE
15 years 10 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
155
click to vote
RTSS
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
153
click to vote
SASO
2007
IEEE
15 years 10 months ago
2007
IEEE
Robots in a swarm construction system need to be able to find their way to all potential places to add material to a structure. In two dimensions, a (trivial) procedure exists fo...
141
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
123
click to vote
ACAL
2007
Springer
15 years 10 months ago
2007
Springer
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...