2063 search results - page 66 / 413 » connection 2007 |
73
Voted
IJON
2007
14 years 10 months ago
2007
In many studies of self-organized criticality (SOC), branching processes were used to model the dynamics of the activity of the system during avalanches. This mathematical simpliď...
92
Voted
CEAS
2007
Springer
15 years 5 months ago
2007
Springer
The current mail server architecture spawns a new process upon every new connection it receives. The new process deals with the handling of the mail from accepting “Helo” info...
ICRA
2007
IEEE
15 years 5 months ago
2007
IEEE
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
88
Voted
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
102
Voted
NETWORKING
2007
15 years 10 days ago
2007
While current on-demand routing protocols are optimized to take into account unique features of mobile ad hoc networks (MANETs) such as frequent topology changes and limited batter...