447 search results - page 49 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
91
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
To accelerate the learning of reinforcement learning, many types of function approximation are used to represent state value. However function approximation reduces the accuracy o...
129
Voted
ACISP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
139
Voted
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
119
Voted
PADS
1999
ACM
15 years 8 months ago
1999
ACM
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
144
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...