Sciweavers

5866 search results - page 915 / 1174
» An e-Process Selection Model
Sort
View
CPAIOR
2006
Springer
15 years 10 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ECML
2006
Springer
15 years 10 months ago
Bayesian Active Learning for Sensitivity Analysis
Abstract. Designs of micro electro-mechanical devices need to be robust against fluctuations in mass production. Computer experiments with tens of parameters are used to explore th...
Tobias Pfingsten
177
Voted
GCC
2006
Springer
15 years 10 months ago
BSM: A scheduling algorithm for dynamic jobs based on economics theory
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
Bo Cao, Yongwei Wu, Guangwen Yang, Jia Liu, Jianji...
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
15 years 10 months ago
The Baldwin effect under spatial isolation and autonomous reproduction
The impact of learning on evolution in dynamic environments undergoes recognized stages of the Baldwin Effect although its cause is not clear. To identify it experimentally, we de...
H. L. Peng, J. C. Tay
3DIM
2001
IEEE
15 years 10 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