5090 search results - page 600 / 1018 » Constructing Strategies for Programming |
174
click to vote
JGO
2008
15 years 6 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
166
click to vote
JBI
2006
15 years 6 months ago
2006
Bioinformatics is a dynamic research area in which a large number of algorithms and programs have been developed rapidly and independently without much consideration so far of the...
143
click to vote
LISP
2006
15 years 6 months ago
2006
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
169
click to vote
ECCC
2002
15 years 6 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
184
click to vote
INFORMATICALT
2000
15 years 6 months ago
2000
Abstract. The paper presents new method for sequential classification of the time series observations. Methods and algorithms of sequential recognition are obtained on the basis of...