Vor Ort
Merkzettel Warenkorb
  • Produktbild: Frontiers in Algorithmics
  • Produktbild: Frontiers in Algorithmics
Band 5598

Frontiers in Algorithmics Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings

Aus der Reihe Lecture Notes in Computer Science

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.06.2009

Abbildungen

XIV, 372 p.

Herausgeber

Xiaotie Deng + weitere

Verlag

Springer Berlin

Seitenzahl

372

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

587 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-642-02269-2

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

08.06.2009

Abbildungen

XIV, 372 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

372

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

587 g

Auflage

2009

Sprache

Englisch

ISBN

978-3-642-02269-2

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Frontiers in Algorithmics
  • Produktbild: Frontiers in Algorithmics
  • FAW 2009.- Study on Parallel Computing.- Communication Complexity and Its Applications.- Algorithmic Problems in Computer and Network Power Management.- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.- Edge Search Number of Cographs in Linear Time.- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems.- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.- Covering-Based Routing Algorithms for Cyclic Content-Based P/S System.- On the ?-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games.- Cop-Robber Guarding Game with Cycle Robber Region.- Covered Interest Arbitrage in Exchange Rate Forecasting Markets.- CFI Construction and Balanced Graphs.- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions.- Space–Query-Time Tradeoff for Computing the Visibility Polygon.- Square and Rectangle Covering with Outliers.- Processing an Offline Insertion-Query Sequence with Applications.- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs.- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs.- On Modulo Linked Graphs.- Pathwidth is NP-Hard for Weighted Trees.- A Max-Margin Learning Algorithm with Additional Features.- DDoS Attack Detection Algorithm Using IP Address Features.- Learning with Sequential Minimal Transductive Support Vector Machine.- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams.- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set.- Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks.- Efficient Algorithms forthe Closest String and Distinguishing String Selection Problems.- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning.- Approximating Scheduling Machines with Capacity Constraints.- Approximating the Spanning k-Tree Forest Problem.- Toward an Automatic Approach to Greedy Algorithms.- A Novel Approximate Algorithm for Admission Control.- On the Structure of Consistent Partitions of Substring Set of a Word.- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet.- An Improved Database Classification Algorithm for Multi-database Mining.- Six-Card Secure AND and Four-Card Secure XOR.