329 search results - page 2 / 66 » A note on the Hopf-Stiefel function |
INFORMS
2010
13 years 4 months ago
2010
FOCM
2010
13 years 3 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
CEC
2007
IEEE
14 years 4 days ago
2007
IEEE
—This paper describes an evolutionary music composition system that combines trainable music critics with a bag of notes constraint. Unlike many evolutionary composition systems,...
Book
"These are the lecture notes accompanying the course Introduction to Functional
Programming, which I taught at Cambridge University in the academic year 1996/1997."
IGPL
1998
13 years 5 months ago
1998
One of the ways to model contraction functions for belief sets is epistemic entrenchment. The first step was provided by G¨ardenfors in [5], who defined epistemic entrenchment ...