Sciweavers

7006 search results - page 513 / 1402
» Approximation Algorithms
Sort
View
221
Voted
INFOCOM
2007
IEEE
16 years 22 days ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
15 years 12 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
COMPGEOM
1996
ACM
15 years 10 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
ICML
1994
IEEE
15 years 10 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 7 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...