Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Springer Berlin (Verlag)
978-3-540-74449-8 (ISBN)
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9.- Sequential Vector Packing.- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set.- A More Effective Linear Kernelization for Cluster Editing.- CR-precis: A Deterministic Summary Structure for Update Data Streams.- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning.- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.- A Digital Watermarking Scheme Based on Singular Value Decomposition.- A New (t,n)??Threshold Scheme Based on Difference Equations.- Clique-Transversal Sets in Cubic Graphs.- On the L(h,k)-Labeling of Co-comparability Graphs.- An Approximation Algorithm for the General Mixed Packing and Covering Problem.- Extending the Hardness of RNA Secondary Structure Comparison.- On the On-Line Weighted k-Taxi Problem.- Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling.- On the Minimum Risk-Sum Path Problem.- Constrained Cycle Covers in Halin Graphs.- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost.- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection.- Online Coupon Consumption Problem.- Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization.- Online Capacitated Interval Coloring.- Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service.- Call Control and Routing in SONET Rings.- Fast Matching Method for DNA Sequences.- All-Pairs Ancestor Problems in Weighted Dags.- Streaming Algorithms for Data in Motion.- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers.- Phrase-Based Statistical Language Modeling from Bilingual ParallelCorpus.- Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory.- On-Line Bin Packing with Arbitrary Release Times.- On the Complexity of the Max-Edge-Coloring Problem with Its Variants.- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm.- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance.- Robust Optimization Model for a Class of Uncertain Linear Programs.- An Efficient Algorithm for Solving the Container Loading Problem.- A Bijective Code for k-Trees with Linear Time Encoding and Decoding.- Market-Based Service Selection Framework in Grid Computing.- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data.- Heuristic Search for 2D NMR Alignment to Support Metabolite Identification.- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach.- A New Load Balanced Routing Algorithm for Torus Networks.- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines.- Lower Bounds on Edge Searching.
Erscheint lt. Verlag | 28.9.2007 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XII, 530 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 825 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | algebraic computation • Algorithm analysis and problem complexity • algorithms • Bioinformatics • combinatorics • Complexity • Computational Biology • Data Analysis • Data Compression • Data Mining • Dynamic Programming • financial data processing • graph theory • grid computing • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • internet algorithms • microarray • Modeling • Multimedia • optimizatio • Optimization • probabilistic methods • probabilistic techniques • Randomization • Real Time Systems • Routing • Scheduling • Searching • sequence matching • Simulation • String Algorithms • String Matching • Swarm intelligence • text processing • Vertices • Watermarking |
ISBN-10 | 3-540-74449-5 / 3540744495 |
ISBN-13 | 978-3-540-74449-8 / 9783540744498 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich