72 search results - page 9 / 15 » A Branch and Bound Algorithm for Exact, Upper, and Lower Bou... |
IDA
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
ENDM
2010
13 years 7 months ago
2010
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
APVIS
2008
13 years 9 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...