Sciweavers

1404 search results - page 29 / 281
» Complexity of admissible rules
Sort
View
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
14 years 4 months ago
Where's Waldo? Sensor-Based Temporal Logic Motion Planning
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
Hadas Kress-Gazit, Georgios E. Fainekos, George J....
VTC
2006
IEEE
117views Communications» more  VTC 2006»
14 years 4 months ago
Simulation of Throughput in UMTS Networks with Different Spreading Factors
— We design and implement a local session1 admission control (SAC) algorithm for third-generation wireless networks which allows for the simulation of network throughput for diff...
Robert Akl, Anurag Arepally
GI
2001
Springer
14 years 2 months ago
M-YESSIR: A Low Latency Reservation Protocol for Mobile-IP Networks
Abstract—Advanced network and media applications such as multimedia streaming and Internet telephony are becoming an integral part of the Internet. Reservation protocols, such as...
Hromuzd Khosravi, Daniel Reininger, Maximilian Ott...
TCOM
2008
74views more  TCOM 2008»
13 years 10 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
TCS
2008
13 years 10 months ago
Learning recursive functions: A survey
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
Thomas Zeugmann, Sandra Zilles