Sciweavers

347 search results - page 13 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
134
Voted
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
15 years 3 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
116
Voted
JASSS
2002
85views more  JASSS 2002»
15 years 3 months ago
Opinion dynamics and bounded confidence: models, analysis and simulation
When does opinion formation within an interacting group lead to consensus, polarization or fragmentation? The article investigates various models for the dynamics of continuous opi...
Rainer Hegselmann, Ulrich Krause
141
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
156
Voted
SIGGRAPH
1992
ACM
15 years 7 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
126
Voted
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 4 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella