Sciweavers

141 search results - page 21 / 29
» State dependent computation using coupled recurrent networks
Sort
View
SPAA
2003
ACM
15 years 3 months ago
Analysis of link reversal routing algorithms for mobile ad hoc networks
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
Costas Busch, Srikanth Surapaneni, Srikanta Tirtha...
IJON
2007
96views more  IJON 2007»
14 years 10 months ago
Suppressive effects in visual search: A neurocomputational analysis of preview search
In the real world, visual information is selected over time as well as space, when we prioritise new stimuli for attention. Watson and Humphreys [Visual marking: prioritising sele...
Eirini Mavritsaki, Dietmar Heinke, Glyn W. Humphre...
TSP
2008
122views more  TSP 2008»
14 years 10 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
SIMPRA
2010
95views more  SIMPRA 2010»
14 years 8 months ago
State-dependent stochastic mobility model in mobile communication networks
Abstract — We apply finite state-dependent queueing networks to model mobility in mobile communication systems. Although they have been successfully used in the past to model ve...
Frederico R. B. Cruz, P. C. Oliveira, Luiz Duczmal
ICS
2007
Tsinghua U.
15 years 4 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson