2976 search results - page 118 / 596 » On the bounded integer programming |
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
96
Voted
EUROPAR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
77
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
114
click to vote
COR
2007
15 years 17 days ago
2007
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
ICALP
2004
Springer
15 years 6 months ago
2004
Springer