Sciweavers

3049 search results - page 576 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
DOCENG
2006
ACM
14 years 2 months ago
Evaluating invariances in document layout functions
With the development of variable-data-driven digital presses where each document printed is potentially unique there is a need for pre-press optimization to identify material that...
Alexander J. Macdonald, David F. Brailsford, John ...
ECAL
2005
Springer
14 years 2 months ago
A Dynamical Systems Approach to Learning: A Frequency-Adaptive Hopper Robot
We present an example of the dynamical systems approach to learning and adaptation. Our goal is to explore how both control and learning can be embedded into a single dynamical sys...
Jonas Buchli, Ludovic Righetti, Auke Jan Ijspeert
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 2 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick