Search

Filter

  • Advanced Filters:

  • to

  • Specific Data Sources:

    All Edit

    Select All  |  Select None

Reset filters

← Back to Search Results

Journals ACM SIGACT News Volume 40 Issue 3

SIGACT News Online Algorithms Column 14 Marek Chrobak Department of Computer Science University of California, Riverside From the editor: This quarter ™s column contains a survey of recent work on optimizing frequency and bandwidth assignment in wireless networks, by Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, and Yong Zhang. This is a new, interesting, and not well explored application area for online algorithms and competitive analysis, with many questions that remain open, and, quite likely, many that have not even been posed yet. If you are interested in contributing to the column as a guest writer, feel free to contact me by email. All kinds of contributions related to online algorithms and competitive analysis are of interest: technical articles, surveys, conference reports, opinion pieces, and other. Online Problems for Frequency Assignment and OVSF Code Assignment in Wireless Communication Networks Joseph Wun-Tat Chan1 Hing-Fung Ting3 Francis Y. L. Chin2 Yong Zhang4 Introduction Over the past decades, wireless communication, which is based on radio access, has played a very important role in many practical applications, such as personal mobile telephone communication. Department Department 3 Department 4 Department of of of of Computer Computer Computer Computer Science, Science, Science,

End of preview. The entire article is 13 pages. To view the full-text, please rent this article to continue.

/lp/association-for-computing-machinery/sigact-news-online-algorithms-column-14-UAgbtlmar3
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%

Learn more

Bookmark

SIGACT news online algorithms column 14

Chrobak, Marek
ACM SIGACT News , Volume 40 (3)
Association for Computing Machinery – Sep 25, 2009

More Info
  • Publisher Association for Computing Machinery
  • Copyright The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc.
  • ISSN 0163-5700
  • D.O.I. 10.1145/1620491.1620508
  • Publisher site Get PDF  

More Like This Article

View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct

Browse: Subject Areas | Journals | Publishers

Sign Up for a DeepDyve Account

Bookmark an Article

To bookmark an article, please log in first, or sign up for a DeepDyve account if you don't already have one.

OK

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don't already have one.

OK

Thank you for renting with DeepDyve

Your PayPal account has been charged $2.99. You now have access to the full text of this article. A rental receipt has also been sent to your email address.

Your credit card has been charged $2.99. You now have access to the full text of this article. A rental receipt has also been sent to your email address.

OK

New! You can now keep track of new articles from ACM SIGACT News on your personalized homepage! Learn more

PDF Download — Not Available

Thanks for your interest in purchasing the PDF. Your request has been noted and we will work with our publisher partner to discuss enabling this feature.

In the meantime, you can get the PDF by visiting the publisher site.

Thank you for purchasing with DeepDyve

Your PayPal account has been charged $.

Your credit card has been charged $.

You can now download this article. A purchase receipt has also been sent to your email address.

Download This Article or I'm done with my download

Print Page — Not Available

Thanks for your interest in printing individual pages. Your request has been noted and we will work with our publisher partner to discuss enabling this feature.

In the meantime, you can get the PDF by visiting the publisher site.

Thank you for printing with DeepDyve

Your PayPal account has been charged $0.

Your credit card has been charged $0.

You can now print this article. A purchase receipt has also been sent to your email address.

Print the Selected Pages or I'm done with my printing

Please refresh to generate a new download link

Your article download link has expired. Please refresh this page to obtain a new download link and try again.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don't already have one.

OK