Sciweavers

9049 search results - page 290 / 1810
» The New C Standard
Sort
View
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
NIPS
1997
15 years 8 months ago
Statistical Models of Conditioning
Conditioning experiments probe the ways that animals make predictions about rewards and punishments and use those predictions to control their behavior. One standard model of cond...
Peter Dayan, Theresa Long
MOR
2008
81views more  MOR 2008»
15 years 6 months ago
Optimal Stopping of Linear Diffusions with Random Discounting
Abstract. We propose a new solution method for optimal stopping problems with random discounting for linear diffusions whose state space has a combination of natural, absorbing, or...
Savas Dayanik
MOC
2000
87views more  MOC 2000»
15 years 6 months ago
Improving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...
CEC
2010
IEEE
15 years 5 months ago
A novel hybrid evolutionary strategy and its periodization with multi-objective genetic optimizers
— This work investigates the effects of the periodization of local and global multi-objective search algorithms. To this, we introduce a model for periodization and define a new...
Paul Kaufmann, Tobias Knieper, Marco Platzner