Sciweavers

3780 search results - page 69 / 756
» Algorithms for Game Metrics
Sort
View
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
14 years 4 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
ATAL
2008
Springer
13 years 12 months ago
Strategic betting for competitive agents
In many multiagent settings, each agent's goal is to come out ahead of the other agents on some metric, such as the currency obtained by the agent. In such settings, it is no...
Liad Wagman, Vincent Conitzer
IMC
2007
ACM
13 years 11 months ago
Studying wireless routing link metric dynamics
Multi-hop wireless mesh networks are increasingly being deployed for last-mile Internet access. Typically, network algorithms such as routing, channel assignment and topology cont...
Saumitra M. Das, Himabindu Pucha, Konstantina Papa...

Lecture Notes
742views
15 years 8 months ago
Computer Systems Analysis
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
Raj Jain
CVPR
2009
IEEE
14 years 1 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum