Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Invitación a transmitir")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 321

  • Page / 13
Export

Selection :

  • and

Stability conditions for a pipeline polling scheme in satellite communicationsCHANG, K. C.Queueing systems. 1993, Vol 14, Num 3-4, pp 339-348, issn 0257-0130Article

The use of service limits for efficient operation of multi-station single-medium communication systemsBORST, S. C; BOXMA, O. J.Report - Department of Operations Research, Statistics, and System Theory. 1993, Num 12, pp 1-24, issn 0924-0659Article

Polling with physical envelopes : A rigorous analysis of a human-centric-protocolMORAN, Tal; NAOR, Moni.Lecture notes in computer science. 2006, pp 88-108, issn 0302-9743, isbn 3-540-34546-9, 1Vol, 21 p.Conference Paper

Topological-order based dynamic polling scheme using routing path for network monitoringBYOUNGWOO YOON; SEONGJIN AHN; JINWOOK CHUNG et al.Lecture notes in computer science. 2003, pp 292-301, issn 0302-9743, isbn 3-540-40456-2, 10 p.Conference Paper

Message delay for a priority-based automatic meter reading networkFRIGUI, I; STONE, R; ATTAHIRU SULE ALFA et al.Computer communications. 1997, Vol 20, Num 1, pp 38-47, issn 0140-3664Article

Gated-type polling systems with walking and switch-in timesALTMAN, E; BLANC, H; KHAMISY, A et al.Communications in statistics. Stochastic models. 1994, Vol 10, Num 4, pp 741-763, issn 0882-0287Article

Scalable locality-aware event dispatching mechanism for network serversLIU, H.-R; CHEN, T.-F.IEE Proceedings - Software (Print). 2004, Vol 151, Num 3, pp 129-137, issn 1462-5970, 9 p.Article

On the stability of polling models with multiple serversDOWN, D. G.Report - Department of Operations Research, Statistics, and System Theory. 1996, Num 5, pp 1-10, issn 0924-0659Article

Location polling algorithm for alerting service based on locationAHN, Byung-Ik; YANG, Sung-Bong; JIN, Heui-Chae et al.Lecture notes in computer science. 2005, pp 104-114, issn 0302-9743, isbn 3-540-30848-2, 1Vol, 11 p.Conference Paper

A prototype for functionality based network management systemNEELANARAYANAN, V; SATYANARAYANA, N; SUBRAMANIAN, N et al.Lecture notes in computer science. 2002, pp 110-116, issn 0302-9743, isbn 3-540-00028-3, 7 p.Conference Paper

Polling models with and without switchover timesBORST, S. C; BOXMA, O. J.Operations research. 1997, Vol 45, Num 4, pp 536-543, issn 0030-364XArticle

Descendant set : an efficient approach for the analysis of polling systemsKONHEIM, A. G; LEVY, H; SRINIVASAN, M. M et al.IEEE transactions on communications. 1994, Vol 42, Num 2-4, pp 1245-1253, issn 0090-6778, 2Article

Exhaustive service matching algorithms for input queued switchesYIHAN LI; PANWAR, Shivendra S; CHAO, H. Jonathan et al.Workshop on high performance switching and routing. 2004, pp 253-258, isbn 0-7803-8375-3, 1Vol, 6 p.Conference Paper

Splash : SNMP plus a lightweight API for SNAP handlingDE BRUIIN, Willem; BOS, Herbert; MOORE, Jonathan T et al.IEEE/IFIP Network Operations and Management Symposium. 2004, pp 743-756, isbn 0-7803-8230-7, 1Vol, 14 p.Conference Paper

Delay in polling systems in heavy trafficVAN DER MEI, R. D.SPIE proceedings series. 1998, pp 168-175, isbn 0-8194-2991-0Conference Paper

A novel approach to the queue stability analysis of polling modelsLAM, S; CHANG, R. K. C.SPIE proceedings series. 1998, pp 156-167, isbn 0-8194-2991-0Conference Paper

Eliminating receive livelock in an interrupt-driven kernelMOGUL, J. C; RAMAKRISHNAN, K. K.ACM transactions on computer systems. 1997, Vol 15, Num 3, pp 217-252, issn 0734-2071Article

ParaDualMiner: An efficient parallel implementation of the dualminer algorithmTING, Roger M. H; BAILEY, James; RAMAMOHANARAO, Kotagiri et al.Lecture notes in computer science. 2004, pp 96-105, issn 0302-9743, isbn 3-540-22064-X, 10 p.Conference Paper

The architecture and performance of WMPI IICHRISTENSEN, Anders Lyhne; BRITO, Joao; SILVA, Joao Gabriel et al.Lecture notes in computer science. 2004, pp 112-121, issn 0302-9743, isbn 3-540-23163-3, 10 p.Conference Paper

Asymptotic complexity from experiments? A case study for randomized algorithmsSANDERS, Peter; FLEISCHER, Rudolf.Lecture notes in computer science. 2001, pp 135-146, issn 0302-9743, isbn 3-540-42512-8Conference Paper

Polling, greedy and horizon servers on a circle : Telecommunications systems: modeling, analysis and designHAREL, A; STULMAN, A.Operations research. 1995, Vol 43, Num 1, pp 177-186, issn 0030-364XArticle

Input buffer requirements for round robin polling systemsSASAKI, G. H.Performance evaluation. 1993, Vol 18, Num 3, pp 237-261, issn 0166-5316Article

An adaptive method for dynamic audience size estimation in multicastNEKOVEE, Maziar; SOPPERA, Andrea; BURBRIDGE, Trevor et al.Lecture notes in computer science. 2003, pp 23-33, issn 0302-9743, isbn 3-540-20051-7, 11 p.Conference Paper

A stability criterion via fluid limits and its application to a polling systemFOSS, S; KOVALEVSKII, A.Queueing systems. 1999, Vol 32, Num 1-3, pp 131-168, issn 0257-0130Article

A two-stage polling system with multiple serversWAI SUM LAI; HOUCK, D. J; FUHRMANN, S. W et al.SPIE proceedings series. 1997, pp 535-545, isbn 0-8194-2664-4Conference Paper

  • Page / 13