Sciweavers

17082 search results - page 236 / 3417
» Abstractions for Mobile Computation
Sort
View
GLOBECOM
2006
IEEE
14 years 4 months ago
A Novel Semi-Markov Smooth Mobility Model for Mobile Ad Hoc Networks
Abstract— Existing random mobility models have their limitations such as speed decay and sharp turn which have been demonstrated by the previous studies. More importantly, mobili...
Ming Zhao 0001, Wenye Wang
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 10 months ago
Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks
Abstract-- In this paper, we analyze asymptotic delaythroughput trade-offs in mobile ad-hoc networks comprising heterogeneous nodes with restricted mobility. We show that node spat...
Michele Garetto, Emilio Leonardi
CVPR
2001
IEEE
15 years 23 days ago
Generic Model Abstraction from Examples
Model Abstraction from Examples Yakov Keselman, Member, IEEE, and Sven Dickinson, Member, IEEE The recognition community has typically avoided bridging the representational gap bet...
Yakov Keselman, Sven J. Dickinson
ASAP
2010
IEEE
127views Hardware» more  ASAP 2010»
14 years 9 days ago
Design of throughput-optimized arrays from recurrence abstractions
urrence abstractions Arpith C. Jacob Jeremy D. Buhler Roger D. Chamberlain Arpith C. Jacob, Jeremy D. Buhler, and Roger D. Chamberlain, "Design of ut-optimized arrays from rec...
Arpith C. Jacob, Jeremy D. Buhler, Roger D. Chambe...
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 10 months ago
Abstract machines for dialogue games
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...
Pierre-Louis Curien, Hugo Herbelin