logo
logo
x
바코드검색
BOOKPRICE.co.kr
책, 도서 가격비교 사이트
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

Frontiers in Algorithms: 4th International Workshop, Faw 2010, Wuhan, China, August 11-13, 2010, Proceedings

Frontiers in Algorithms: 4th International Workshop, Faw 2010, Wuhan, China, August 11-13, 2010, Proceedings (Paperback, 2010)

Der-tsai Lee (엮은이)
Springer-Verlag New York Inc
117,000원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
95,940원 -18% 0원
4,800원
91,140원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

Frontiers in Algorithms: 4th International Workshop, Faw 2010, Wuhan, China, August 11-13, 2010, Proceedings
eBook 미리보기

책 정보

· 제목 : Frontiers in Algorithms: 4th International Workshop, Faw 2010, Wuhan, China, August 11-13, 2010, Proceedings (Paperback, 2010) 
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9783642145520
· 쪽수 : 339쪽
· 출판일 : 2010-07-12

목차

Progress on Certifying Algorithms.- Computational Geometry for Uncertain Data.- On Foundations of Services Interoperation in Cloud Computing.- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets.- Truthful Auction for CPU Time Slots.- Top-d Rank Aggregation in Web Meta-search Engine.- Minimum Common String Partition Revisited.- Inapproximability of Maximal Strip Recovery: II.- Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy.- Approximation Schemes for Scheduling with Availability Constraints.- An Space Lower Bound for Finding ?-Approximate Quantiles in a Data Stream.- Improved Sublinear Time Algorithm for Width-Bounded Separators.- Constant Time Generation of Biconnected Rooted Plane Graphs.- Solving General Lattice Puzzles.- A Hybrid Graph Representation for Recursive Backtracking Algorithms.- On Tractable Exponential Sums.- Recognizing d-Interval Graphs and d-Track Interval Graphs.- Categorial Semantics of a Solution to Distributed Dining Philosophers Problem.- Approximation Algorithms for the Capacitated Domination Problem.- A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle.- FPTAS's for Some Cut Problems in Weighted Trees.- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.- Online Algorithms for the Newsvendor Problem with and without Censored Demands.- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems.- Path Separability of Graphs.- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.- Computing Minimum Diameter Color-Spanning Sets.- Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares.- Optimum Sweeps of Simple Polygons with Two Guards.- Adaptive Algorithms for Planar Convex Hull Problems.- New Algorithms for Barrier Coverage with Mobile Sensors.

저자소개

Der-tsai Lee (엮은이)    정보 더보기
펼치기
이 포스팅은 쿠팡 파트너스 활동의 일환으로,
이에 따른 일정액의 수수료를 제공받습니다.
이 포스팅은 제휴마케팅이 포함된 광고로 커미션을 지급 받습니다.
도서 DB 제공 : 알라딘 서점(www.aladin.co.kr)
최근 본 책