648 search results - page 70 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
100
click to vote
NIPS
2008
15 years 2 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
114
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
109
click to vote
COLT
2006
Springer
15 years 2 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
97
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
88
Voted
AI
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...