6245 search results - page 1154 / 1249 » A Case for Aggregate Networks |
134
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Thesystempresented here showsthe feasibility of modcling the knowledgeinvolved in a complexmusical activity by integrating sub-symbolicand symbolicprocesses. Thisresearch focuses ...
134
click to vote
FUIN
2000
15 years 4 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
148
click to vote
DKE
2007
15 years 4 months ago
2007
The periodic broadcasting of frequently requested data can reduce the workload of uplink channels and improve data access for users in a wireless network. Since mobile devices hav...
130
click to vote
MST
2000
15 years 4 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
158
click to vote
ALGORITHMICA
1998
15 years 4 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...