Sciweavers

6142 search results - page 160 / 1229
» The Complexity of Partition Functions
Sort
View
IV
2005
IEEE
99views Visualization» more  IV 2005»
15 years 9 months ago
Heterogeneous Objects Modelling and Rendering Using Implicit Complexes
This paper describes a technology for modelling and rendering heterogeneous objects containing entities of various dimensionalities within a cellular-functional framework based on...
Elena Kartasheva, Valery Adzhiev, Peter Comninos, ...
JC
1998
65views more  JC 1998»
15 years 3 months ago
Monte Carlo Complexity of Global Solution of Integral Equations
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
Stefan Heinrich
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 7 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 9 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
COCOON
2008
Springer
15 years 5 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...