1485 search results - page 15 / 297 » connection 2010 |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
AUTOMATICA
2010
13 years 7 months ago
2010
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
IJACTAICIT
2010
13 years 4 months ago
2010
The MTS-88.c trainer is a training system targeting students in the microprocessors course. It has a built in single-line assembler allowing the users to enter programs in assembl...
ENDM
2010
13 years 7 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
DSS
2006
13 years 7 months ago
2006
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...