4233 search results - page 16 / 847 » Three Paths to Effectiveness |
149
Voted
DC
2002
15 years 3 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
141
Voted
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint ...
124
Voted
AAIM
2009
Springer
15 years 10 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
142
click to vote
GD
2000
Springer
15 years 7 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
161
click to vote
AGI
2011
14 years 7 months ago
2011
What set of concepts and formalizations might one use to make a practically useful, theoretically rigorous theory of generally intelligent systems? We present a novel perspective m...