3608 search results - page 168 / 722 » compute 2011 |
162
click to vote
ISCAS
2011
IEEE
14 years 8 months ago
2011
IEEE
— In this study, synchronization phenomena observed in coupled polygonal oscillatory networks with frustration is investigated. We focus on the power consumption of coupling resi...
147
Voted
CSUR
2011
14 years 8 months ago
2011
254
click to vote
ICDCN
2011
Springer
14 years 8 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
135
Voted
TCS
2011
14 years 12 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
211
Voted
QUESTA
2011
14 years 11 months ago
2011
Abstract We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate λ at queue 1, under a back-pressure (MaxWeight) algorithm: service at queu...