Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Syrotiuk, Violet
University of Texas at Dallas
Richardson, Texas
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 22 reviews

   
  Emerging mobile and wireless networks
Varshney U., Vetter R. Communications of the ACM 43(6): 73-81, 2000.  Type: Article

This high-level introduction to mobile and wireless networks is suitable for novices. It begins by explaining the difference between mobile and wireless networks, which sometimes occur together. The growth in this industry is illustrat...

Jun 1 2000  
  An adaptive algorithm for optimizing the packet size used in wireless ARQ protocols
Modiano E. Wireless Networks 5(4): 279-286, 1999.  Type: Article

In wireless environments where the bit error rate (BER) is unknown and can vary over time, the performance of automatic repeat request (ARQ) protocols is sensitive to both packet size and BER. This paper presents a method for dynamical...

Feb 1 2000  
  L2imbo: a distributed systems platform for mobile computing
Davies N., Friday A., Wade S., Blair G. Mobile Networks and Applications 3(2): 143-156, 1998.  Type: Article

L2imbo is a new platform for support ofheterogeneous mobile computing environments that must be able todynamically adapt to changing quality of service (QoS). This researchpaper begins by reviewing some existing mobile distr...

Jul 1 1999  
  Second generation mobile and wireless networks
Black U., Prentice Hall PTR, Upper Saddle River, NJ, 1999.  Type: Book (9780136212775)

The focus of this book is second-generation mobile wireless systems. It is not intended for use as a textbook; instead, the intended audience is people who want an understanding of how these systems work....

May 1 1999  
  Performance evaluation of connection rerouting schemes for ATM-based wireless networks
Ramjee R., La Porta T., Kurose J., Towsley D. (ed) IEEE/ACM Transactions on Networking 6(3): 249-261, 1998.  Type: Article

The authors consider the problem of dynamically rerouting ongoing connections as mobile users undergo handoffs between wireless base stations that are connected to each other and to fixed endpoints through a wired ATM-based backbone ne...

Dec 1 1998  
  Internetwork mobility
Taylor M., Waung W., Banan M., Prentice-Hall, Inc., Upper Saddle River, NJ, 1997.  Type: Book (9780132096935)

The Cellular Digital Packet Data (CDPD) standard is presented as the solution for user mobility in a wide area network (WAN). The book is extremely readable and filled with anecdotes. The authors were active participants in the develop...

Sep 1 1998  
  Cumulated interference power and bit-error-rates in mobile packet radio
Hellebrandt M., Mathar R. Wireless Networks 3(3): 169-172, 1997.  Type: Article

The probability distribution function of cumulated instantaneous interference power in a mobile radio network is determined under realistic mobility patterns and signal transmission characteristics....

May 1 1998  
  Efficient branch and bound search with application to computer-aided design
Chen X., Bushnell M., Kluwer Academic Publishers, Norwell, MA, 1996.  Type: Book (9780792396734)

Chen and Bushnell describe an improved branch-and-bound search method for logic justification, a problem in computer-aided design (CAD). The improvement arises from avoiding duplicate computations (without using search decision trees)....

Aug 1 1997  
  The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
Creignou N. Theoretical Computer Science 145(1-2): 111-145, 1995.  Type: Article

Creignou makes two major contributions in this paper. The first is to greatly extend the class of combinatorial problems that are linear-time equivalent to Satisfiability. This relation splits the class of NP-complete problems into equ...

Aug 1 1996  
  Fast parallel matching in expander graphs
Kelsen P.  Parallel algorithms and architectures (Proceedings of the fifth annual ACM symposium, Velen, Germany, 293-299, 1993.  Type: Proceedings

Let H be a bipartite graph with bipartition ( A , B ) such that every subset X of A with at most a &dundot; | A | ...

Oct 1 1994  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy