Sciweavers

16404 search results - page 710 / 3281
» A set coverage problem
Sort
View
WINE
2009
Springer
194views Economy» more  WINE 2009»
16 years 1 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
IJCNN
2008
IEEE
16 years 1 months ago
Support vector machines and dynamic time warping for time series
— Effective use of support vector machines (SVMs) in classification necessitates the appropriate choice of a kernel. Designing problem specific kernels involves the definition...
Steinn Gudmundsson, Thomas Philip Runarsson, Sven ...
HYBRID
2005
Springer
16 years 24 days ago
Primal-Dual Tests for Safety and Reachability
Abstract. A methodology for safety verification using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formula...
Stephen Prajna, Anders Rantzer
SWAT
2010
Springer
279views Algorithms» more  SWAT 2010»
16 years 10 days ago
Online Function Tracking with Generalized Penalties
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
Marcin Bienkowski, Stefan Schmid
216
Voted
IMPERIAL
1993
15 years 11 months ago
Prioritising Preference Relations
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
Mark Ryan