Sciweavers

254 search results - page 3 / 51
» On the randomized solution of initial value problems
Sort
View
EUSFLAT
2009
145views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Valued Constraint Satisfaction Problems Applied to Functional Harmony
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
Nele Verbiest, Chris Cornelis, Yvan Saeys
CCR
2005
129views more  CCR 2005»
13 years 7 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
AAAI
1996
13 years 8 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
ENTCS
2002
110views more  ENTCS 2002»
13 years 7 months ago
The Solution Operator of the Korteweg-de Vries Equation is Computable
The initial value problem of the Korteweg-de Vries (KdV) equation posted on the real line R: ut + uux + uxxx = 0, x R, t R u(x, 0) = (x), defines a nonlinear map KR from the ...
Klaus Weihrauch, Ning Zhong 0002
CVPR
1999
IEEE
13 years 12 months ago
Efficient Iterative Solution to M-View Projective Reconstruction Problem
We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with ...
Qian Chen, Gérard G. Medioni