Sciweavers

7811 search results - page 283 / 1563
» computer 2004
Sort
View
JSC
2007
79views more  JSC 2007»
15 years 6 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz
EMSOFT
2004
Springer
15 years 12 months ago
A metrics system for quantifying operational coupling in embedded computer control systems
One central issue in system structuring and quality prediction is the interdependencies of system modules. This paper proposes a novel technique for determining the operational co...
De-Jiu Chen, Martin Törngren
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 12 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 12 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
NIPS
2004
15 years 8 months ago
Probabilistic Computation in Spiking Populations
As animals interact with their environments, they must constantly update estimates about their states. Bayesian models combine prior probabilities, a dynamical model and sensory e...
Richard S. Zemel, Quentin J. M. Huys, Rama Nataraj...