6045 search results - page 255 / 1209 » Computable Linearizations of Well-partial-orderings |
177
click to vote
ESANN
2007
15 years 8 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
175
click to vote
ADCM
2007
15 years 7 months ago
2007
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
204
click to vote
WSC
2008
15 years 9 months ago
2008
In this paper, we suggest a linear programming formulation that allows for solving volume and capacity planning problems in semiconductor manufacturing systems. We assume a genera...
200
click to vote
MSS
2008
IEEE
15 years 7 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
160
click to vote
IFIP
2000
Springer
15 years 10 months ago
2000
Springer
Scientific programs rely heavily on software libraries. This paper describes the limitations of this reliance and shows how it degrades software quality. We offer a solution that u...