1 / 469
文档名称:

Algorithms For Next Generation Networks (Springer, 2010, 1848827644).pdf

格式:pdf   页数:469
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

Algorithms For Next Generation Networks (Springer, 2010, 1848827644).pdf

上传人:bolee65 2014/1/27 文件大小:0 KB

下载得到文件列表

Algorithms For Next Generation Networks (Springer, 2010, 1848827644).pdf

文档介绍

文档介绍:munications works
For other titles published in this series, go to
ies/4198
munications works series is a range of textbooks, monographs
and handbooks. It sets out to provide students, researchers and non-specialists alike with
a sure grounding in current knowledge, together prehensible access to the latest
developments munications working.
Emphasis is placed on clear and explanatory styles that support a tutorial approach, so that
even the plex of topics is presented in a lucid and intelligible manner.
Graham Cormode • Marina Thottan
Editors
Algorithms for Next
works
123
Editors
Dr. Graham Cormode Dr. Marina Thottan
AT&T Research Bell Labs
Florham Park Murray Hill
NJ, USA NJ, USA
******@research. ******@alcatel-
Series Editor
Professor . Sammes, BSc, MPhil, PhD, FBCS, CEng
Centre for puting
Cranfield University
DCMT, Shrivenham
Swindon SN6 8LA
UK
ISSN 1617-7975
ISBN 978-1-84882-764-6 e-ISBN 978-1-84882-765-3
DOI -1-84882-765-3
Springer London Dordrecht Heidelberg New York
British Library Cataloguing in Publication Data
A catalogue record for this book is available from the British Library
Library of Congress Control Number: 2010921297
c Springer-Verlag London Limited 2010
Apart from any fair dealing for the purposes of research or private study, or criticism or review, as
permitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced,
stored or transmitted, in any form or by any means, with the prior permission in writing of the publish-
ers, or in the case of reprographic reproduction in accordance with the terms of licenses issued by the
Copyright Licensing Agency. Enquiries concerning reproduction outside those terms should be sent to
the publishers.
The use of registered names, trademarks, etc., in this publication does not imply, even in the absence of a
specific statement, that such names are exempt from the relevant laws and regulations and therefore free
for gen