951 search results - page 37 / 191 » On the Computation of Correctly-Rounded Sums |
105
click to vote
HEURISTICS
1998
14 years 10 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
108
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
DCC
2007
IEEE
15 years 10 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
91
Voted
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...