网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

Computing and Combinatorics 计算和组合

分享到:
Computing and Combinatorics 计算和组合

最 低 价:¥1006.80

定 价:¥1118.70

作 者:LushengWang 著

出 版 社:北京燕山出版社

出版时间:2005-9-1

I S B N:9783540280613

价格
1006.80元

商品详情

编辑推荐

内容简介

The refereed proceedings of the 11th Annual International Computing and Combinatorics Conference, COCOON 2005, held in Kunming, China in August 2005.
  The 96 revised full papers presented together with absts of 3 invited talks were carefully reviewed and selected from 353 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing and are organized in topical sections on bioinformatics, networks, string algorithms, scheduling, complexity, steiner trees, graph drawing and layout design, quantum computing, randomized algorithms, geometry, codes, finance, facility location, graph theory, graph algorithms

作者简介

目录

Invited Lectures
Completeness for Parity Problems
 Monotony and Surprise
 Smoothed Analysis of Algorithms and Heuristics
Bioinformatics
 Gene Network: Model, Dynamics and Simulation
 Conserved Interval Distance Computation Between Non-trivial Genomes
 RNA Multiple Structural Alignment with Longest Common Subsequences
 Perfect Sorting by Reversals
 Genome Rearrangements with Partially Ordered Chromosomes
 Quartet-Based Phylogeny Reconstruction from Gene Orders
 Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
 RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
 A New Pseudoknots Foldin~ Algorithm for RNA Structure Prediction
 Rapid Homology Search with Two-Stage Extension and Daughter Seeds
 On the Approximation of Computing Evolutionary Trees
Networks
 Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
 Improved Approximation Algorithms for the Capacitated Multicast Routing Problem
 Construction of Scale-Free Networks with Partial Information
 Radio Networks with Reliable Communication
 Geometric Network Design with Selfish Agents
 Bicriteria Network Design via Iterative Rounding
 Interference in Cellular Networks:
 The Minimum Membership Set Cover Problem
 Routing and Coloring for Maximal Number of Trees
 Share the Multicast Payment Fairly
 On Packing and Coloring Hyperedges in a Cycle
 Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
String Algorithms
 Best Fitting Fixed-Length Substring Patterns for a Set of Strings
 String Coding of Trees with Locality and Heritability
……
Scheduling
Complexity
Steiner Trees
Graph Drawing and Layout Design
Quantum Computing
Randomizde Algorithms
Geometry
Codes
Finance
Facility Location
Graph THeory
Graph Algorithms
Others
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...