Andere Kunden interessierten sich auch für
![Swarm Robotics Cooperative Movement Control using PSO & IPM Algorithms]( "Swarm Robotics Cooperative Movement Control using PSO & IPM Algorithms")
Swarm Robotics Cooperative Movement Control using PSO & IPM Algorithms51,99 €![Faster Algorithms Via Approximation Theory]( "Faster Algorithms Via Approximation Theory")
Faster Algorithms Via Approximation Theory82,99 €![Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers]( "Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers")
Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers93,99 €![The Impact of Information Technology (IT) Policies and Strategies to Organization's Competitive Advantage]( "The Impact of Information Technology (IT) Policies and Strategies to Organization's Competitive Advantage")
The Impact of Information Technology (IT) Policies and Strategies to Organization's Competitive Advantage17,95 €![Energy Efficiency in Wireless Networks via Fractional Programming Theory]( "Energy Efficiency in Wireless Networks via Fractional Programming Theory")
Energy Efficiency in Wireless Networks via Fractional Programming Theory108,99 €![Full and partial Jacobian computation via graph coloring: Algorithms and applications]( "Full and partial Jacobian computation via graph coloring: Algorithms and applications")
Full and partial Jacobian computation via graph coloring: Algorithms and applications36,77 €![The Weighted Dual Functions for WSGB Bases]( "The Weighted Dual Functions for WSGB Bases")
The Weighted Dual Functions for WSGB Bases26,99 €
The Design of Competitive Online Algorithms via a Primal-Dual Approach extends the primal-dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems. Among the online problems considered are the weighted caching problem, generalized caching, the set-cover problem, several graph optimization problems, routing, load balancing, and the problem of allocating ad-auctions. There is also an illustration of how classic online problems such as the ski rental problem and the dynamic TCP-acknowledgement problem can be solved optimally using a simple primal-dual approach. The Design of Competitive Online Algorithms via a Primal-Dual Approach is an invaluable reference for anyone working in the area of computational theory, and especially those interested in exploring online scenarios that can benefit from the primal-dual framework