Sciweavers

2520 search results - page 431 / 504
» The complexity of approximating entropy
Sort
View
137
Voted
CCE
2004
15 years 3 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
CPHYSICS
2004
89views more  CPHYSICS 2004»
15 years 3 months ago
Comprehensive suite of codes for plasma-edge modelling
The various aspects of plasma-edge physics are included in a comprehensive suite of codes having applications from industrial plasmas to fusion devices. Here the basic ideas, stat...
Ralf Schneider, Xavier Bonnin, Neil McTaggart, Ale...
CG
2002
Springer
15 years 3 months ago
Analytical methods for polynomial weighted convolution surfaces with various kernels
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
Xiaogang Jin, Chiew-Lan Tai
ECCC
2000
158views more  ECCC 2000»
15 years 3 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
IVC
2000
179views more  IVC 2000»
15 years 3 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...