2421 search results - page 26 / 485 » Approximate Flow-Aware Networking |
184
click to vote
NETWORKS
2011
15 years 1 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
350
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
158
click to vote
CONIELECOMP
2006
IEEE
16 years 15 days ago
2006
IEEE
This paper presents a wavelet neural-network for learning and approximation of chaotic time series. Wavelet-networks are inspired by both feed-forward neural networks and the theo...
187
click to vote
MOBIHOC
2010
ACM
15 years 4 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
180
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...