Sciweavers

417 search results - page 80 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 21 days ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
CPAIOR
2006
Springer
13 years 11 months ago
Duality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
John N. Hooker
ATAL
2010
Springer
13 years 8 months ago
Coalition structure generation in multi-agent systems with mixed externalities
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
Bikramjit Banerjee, Landon Kraemer
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 7 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
14 years 4 months ago
Convergence, Stability, and Discrete Approximation of Laplace Spectra
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
Tamal K. Dey, Pawas Ranjan, Yusu Wang