Results 1 - 10
of
11,796
Map Generalization by Iterative Improvement
, 2000
"... ated annealing) were shown to be successful both in limiting the number of realisations visited and in reducing conflict. An alternative to generating multiple candidate positions at each stage of the procedure is to generate a displacement vector that minimises the conflict of the object in greates ..."
Abstract
- Add to MetaCart
, that the iterative improvement approach is generic in that it is possible
Iterative improvement of neural classifiers
- Proceedings of the Seventeenth International Conference of the Florida AI Research Society
, 2004
"... A new objective function for neural net classifier design is presented, which has more free parameters than the classical objective function. An iterative minimization technique for the objective function is derived which requires the solution of multiple sets of numerically ill-conditioned linear e ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
and to networks used to classify handprinted numeral image data. The improvement of the iterative technique over classical de-sign approaches is clearly demonstrated.
Iterative Improvement of Trigonometric Networks
- in Proceedings of the International Joint Conference on Neural Networks
, 1999
"... The trigonometric network, introduced in this paper, is a multilayer feedforward neural network with sinusoidal activation functions. Unlike the N-dimensional Fourier series, the basis functions of the proposed trigonometric network have no strict harmonic relationship. An effective training algori ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The trigonometric network, introduced in this paper, is a multilayer feedforward neural network with sinusoidal activation functions. Unlike the N-dimensional Fourier series, the basis functions of the proposed trigonometric network have no strict harmonic relationship. An effective training algorithm for the network is developed. It is shown that the trigonometric network performs better than the sigmoidal neural network for some data sets. A pruning method based on the modified Gram-Schmidt orthogonalization procedure is presented to detect and prune useless hidden units. Other network architectures related to the trigonometric network, such as the sine network, are shown to be inferior to the network proposed in this paper. I. Introduction The trigonometric feedforward neural network proposed in this paper has both sine and cosine activations for each hidden layer net function. Since the derivative of the activations for the net function are never simultaneously zero, the hope is...
Iterative improvement of the shallow-ice approximation
"... ABSTRACT. We present a new algorithm for a fast iterative improvement of the shallow-ice approximation (SIA) for the modeling of glacier flow. Based on the traditional SIA scaling assumptions, the solution of the Stokes problem is found by an operator-splitting iterative technique. The SIA solution ..."
Abstract
- Add to MetaCart
ABSTRACT. We present a new algorithm for a fast iterative improvement of the shallow-ice approximation (SIA) for the modeling of glacier flow. Based on the traditional SIA scaling assumptions, the solution of the Stokes problem is found by an operator-splitting iterative technique. The SIA solution
Improving retrieval performance by relevance feedback
- Journal of the American Society for Information Science
, 1990
"... Relevance feedback is an automatic process, introduced over 20 years ago, designed to produce improved query formulations following an initial retrieval operation. The principal relevance feedback methods described over the years are examined briefly, and evaluation data are included to demonstrate ..."
Abstract
-
Cited by 756 (6 self)
- Add to MetaCart
Relevance feedback is an automatic process, introduced over 20 years ago, designed to produce improved query formulations following an initial retrieval operation. The principal relevance feedback methods described over the years are examined briefly, and evaluation data are included to demonstrate
A Linear-Time Heuristic for Improving Network Partitions
, 1982
"... An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning. To d ..."
Abstract
-
Cited by 524 (0 self)
- Add to MetaCart
An iterative mincut heuristic for partitioning networks is presented whose worst case computation time, per pass, grows linearly with the size of the network. In practice, only a very small number of passes are typically needed, leading to a fast approximation algorithm for mincut partitioning
MAFFT version 5: improvement in accuracy of multiple sequence alignment
- NUCLEIC ACIDS RES
, 2005
"... The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, H-INS-i, F-INS-i and G-INS-i, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed high ..."
Abstract
-
Cited by 801 (5 self)
- Add to MetaCart
The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, H-INS-i, F-INS-i and G-INS-i, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed
Comparison of Iterative Improvement Techniques for Schedule Optimization
- EUROPEAN JOURNAL ON OPERATIONS RESEARCH
, 1994
"... Due to complexity reasons of realistic scheduling applications, often iterative improvement techniques that perform a kind of local search to improve a given schedule are proposed instead of enumeration techniques that guarantee optimal solutions. In this paper we describe an experimental compari ..."
Abstract
-
Cited by 27 (9 self)
- Add to MetaCart
Due to complexity reasons of realistic scheduling applications, often iterative improvement techniques that perform a kind of local search to improve a given schedule are proposed instead of enumeration techniques that guarantee optimal solutions. In this paper we describe an experimental
Trace Scheduling: A Technique for Global Microcode Compaction
- IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract
-
Cited by 683 (5 self)
- Add to MetaCart
with a broad overview of the program. Important operations are given priority, no matter what their source block was. This is in sharp contrast with earlier methods, which compact one block at a time and then attempt iterative improvement. It is argued that those methods suffer from the lack
Genet: A connectionist architecture for solving constraint satisfaction problems by iterative improvement
- In Proceedings of AAAI'94
, 1994
"... New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the million queens. However, on highly constrained problems it is possible for these methods to get caught in local minima. In th ..."
Abstract
-
Cited by 92 (19 self)
- Add to MetaCart
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the million queens. However, on highly constrained problems it is possible for these methods to get caught in local minima
Results 1 - 10
of
11,796