Sciweavers

139 search results - page 25 / 28
» Sample Spaces and Feature Models: There and Back Again
Sort
View
IOR
2007
119views more  IOR 2007»
14 years 10 months ago
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
Alfredo Garcia, Stephen D. Patek, Kaushik Sinha
3DIM
2001
IEEE
15 years 1 months ago
Efficient Variants of the ICP Algorithm
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
Szymon Rusinkiewicz, Marc Levoy
PLDI
2010
ACM
15 years 3 months ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...
ECAL
1995
Springer
15 years 1 months ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph
SIAMCO
2011
14 years 5 months ago
Admissible Strategies in Semimartingale Portfolio Selection
The choice of admissible trading strategies in mathematical modelling of financial markets is a delicate issue, going back to Harrison and Kreps [HK79]. In the context of optimal...
Sara Biagini, Ales Cerný