|刊登類別:
有類似物品要出售?

Frontiers in Algorithmics: Third International Workshop, FAW 2009, Hefei, China,

狀況:
全新
庫存 3 件
價格:
US $66.42
大約HK$ 519.63
運費:
免費 Economy Shipping. 查看詳情— 運送
所在地:Fairfield, Ohio, 美國
送達日期:
估計於 6月18日, 二6月29日, 六之間送達 運送地點 43230
估計送達日期 — 會在新視窗或分頁中開啟考慮到賣家的處理時間、寄出地郵遞區碼、目的地郵遞區碼、接收包裹時間,並取決於所選的運送方式以及收到全部款項全部款項 — 會在新視窗或分頁中開啟的時間。送達時間會因時而異,尤其是節日。
退貨:
30 日退貨. 由買家支付退貨運費. 查看詳情- 更多退貨相關資訊
保障:
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
(不符合「eBay 買家保障方案」資格)

安心購物

高度評價賣家
值得信賴的賣家,發貨快,輕鬆退貨。 

賣家資料

註冊為商業賣家
賣家必須承擔此刊登物品的所有責任。
eBay 物品編號:395142288373
上次更新時間: 2024-05-19 14:33:09查看所有版本查看所有版本

物品細節

物品狀況
全新: 全新,未閱讀過和使用過的書籍,狀況完好,不存在缺頁或內頁受損。 查看所有物品狀況定義會在新視窗或分頁中開啟
ISBN-13
9783642022692
Book Title
Frontiers in Algorithmics
ISBN
9783642022692
Series
Lecture Notes in Computer Science Ser.
Publication Year
2009
Type
Textbook
Format
Trade Paperback
Language
English
Publication Name
Frontiers in Algorithmics : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings
Author
John E. Hopcroft
Item Length
9.3in
Publisher
Springer Berlin / Heidelberg
Item Width
6.1in
Item Weight
20.9 Oz
Number of Pages
Xiv, 372 Pages

關於產品

Product Information

This book constitutes the refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
3642022693
ISBN-13
9783642022692
eBay Product ID (ePID)
73931093

Product Key Features

Author
John E. Hopcroft
Publication Name
Frontiers in Algorithmics : Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings
Format
Trade Paperback
Language
English
Series
Lecture Notes in Computer Science Ser.
Publication Year
2009
Type
Textbook
Number of Pages
Xiv, 372 Pages

Dimensions

Item Length
9.3in
Item Width
6.1in
Item Weight
20.9 Oz

Additional Product Features

Series Volume Number
5598
Number of Volumes
1 Vol.
Lc Classification Number
Q336
Table of Content
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.
Copyright Date
2009
Topic
Programming / Algorithms, Computer Science, Intelligence (Ai) & Semantics, Databases / General
Intended Audience
Scholarly & Professional
Illustrated
Yes
Genre
Computers

賣家提供的物品說明

grandeagleretail

grandeagleretail

98.3% 正面信用評價
已賣出 270.02 萬 件物品
瀏覽商店聯絡
通常在 24 小時內回覆

詳盡賣家評級

過去 12 個月的平均評級

說明準確
4.9
運費合理
5.0
運送速度
4.9
溝通
4.9

賣家信用評價 (1,024,260)

4***n (1963)- 買家留下的信用評價。
過去 1 個月
購買已獲認證
I got as expected Thank you
o***i (756)- 買家留下的信用評價。
過去 1 個月
購買已獲認證
Quick shipper
h***s (698)- 買家留下的信用評價。
過去 1 個月
購買已獲認證
This volume is a great compendium of piano exercises by some of the greatest masters, all beautifully edited. This is but the first of seven volumes that Alberto Jonas compiled in the 1920s. Long out of print and nearly impossible to find, pianist Sara Davis Buechner and Dover Publications reprinted Volumes 1 and 2 in 2011. It is not clear if and when the remaining five volumes might appear.