Sciweavers

533 search results - page 95 / 107
» The Computational Complexity of Sensitivity Analysis and Par...
Sort
View
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Determining Orbital Elements of Extrasolar Planets by Evolution Strategies
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
Andreas M. Chwatal, Günther R. Raidl
EOR
2006
76views more  EOR 2006»
13 years 7 months ago
Regional development assessment: A structural equation approach
We propose a multivariate statistical framework for regional development assessment based on structural equation modelling with latent variables and show how such methods can be c...
Dario Cziráky, Joze Sambt, Joze Rovan, Jaks...
JSC
2010
155views more  JSC 2010»
13 years 6 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
CVPR
2000
IEEE
14 years 9 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 1 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman