Cheng siu wing (9 Ergebnisse)

Zustand: New. In English.

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Papers.- Further Reflections on a Theory for Basic Algorithms.- Algorithmic DNA Self-assembly.- Contributed Papers.- Online Scheduling on Parallel Machines with Two GoS Levels.- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model.- Online Scheduling with Hard Deadlines on Parallel Machines.- Maximizing the Throughput of Multiple Machines On-Line.- Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set.- Linear Programming Polytope and Algorithm for Mean Payoff Games.- Atomic Routing Games on Maximum Congestion.- Equilibrium Distribution of Advertising Prices.- Finding Faithful Boyce-Codd Normal Form Decompositions.- Instant Service Policy and Its Application to Deficit Round Robin.- A Compression-Boosting Transform for Two-Dimensional Data.- Non-metric Multicommodity and Multilevel Facility Location.- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem.- Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths.- Distributions of Points and Large Convex Hulls of k Points.- Throwing Stones Inside Simple Polygons.- Some Basics on Tolerances.- Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem.- Inverse Bottleneck Optimization Problems on Networks.- An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.- Connected Set Cover Problem and Its Applications.- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth.- Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.- A New Approach for Solving the Maximum Clique Problem.- The Approximability of the ExemplarBreakpoint Distance Problem.- Computing the -Seeds of a String.- Subsequence Packing: Complexity, Approximation, and Application.- Decomposition Based Heuristic Approach to Frequency Reassignment Problem.- Approximation Algorithms for Minimum Span Channel Assignment Problems.- Weighted Broadcast in Linear Radio Networks.- Secure Overlay Network Design.- A Portfolio Selection Method Based on Possibility Theory.- Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions.- Note on an Auction Procedure for a Matching Game in Polynomial Time.…

Paperback. Zustand: Brand New. 2013 edition. 790 pages. 9.20x6.10x1.65 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.…

Taschenbuch. Zustand: Neu. Algorithms and Computation | 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings | Leizhen Cai (u. a.) | Taschenbuch | xviii | Englisch | 2013 | Springer | EAN 9783642450297 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 768 | Sprache: Englisch | Produktart: Bücher | This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.…

Zustand: New. Siu-Wing Cheng is a professor in the Department of Computer Science and Engineering at the Hong Kong University of Science and Technology. Professor Cheng is an advisory committee member of the International Symposium on Algorithms and C.

Buch. Zustand: Neu. Neuware - Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces. Covering both volume and surface meshes, the authors fully explain how and why these meshing algorithms work.The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations. It begins with introducing the problem of mesh generation and describing algorithms for constructing Delaunay triangulations. The authors then present algorithms for generating high-quality meshes in polygonal and polyhedral domains. They also illustrate how to use restricted Delaunay triangulations to extend the algorithms to surfaces with ridges and patches and volumes with smooth surfaces.For researchers and graduate students, the book offers a rigorous theoretical analysis of mesh generation methods. It provides the necessary mathematical foundations and core theoretical results upon which researchers can build even better algorithms in the future.For engineers, the book shows how the algorithms work well in practice. It explains how to effectively implement them in the design and programming of mesh generation software. …