Sciweavers

3270 search results - page 572 / 654
» Approximate String Processing
Sort
View
ANOR
2004
68views more  ANOR 2004»
13 years 10 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
CCE
2004
13 years 10 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
CSL
2004
Springer
13 years 10 months ago
Word sense disambiguation of WordNet glosses
This paper presents a suite of methods and results for the semantic disambiguation of WordNet glosses. WordNet is a resource widely used in natural language processing and artific...
Dan I. Moldovan, Adrian Novischi
JIRS
2000
105views more  JIRS 2000»
13 years 9 months ago
The Formula One Tire Changing Robot (F1-T.C.R.)
: Formula One racing is one of the most fascinating sports ever, it is a perfect combination of high speed, technology, pressure and danger. One problem associated with car racing ...
Raul Mihali, Tarek M. Sobh
NN
2000
Springer
165views Neural Networks» more  NN 2000»
13 years 9 months ago
Construction of confidence intervals for neural networks based on least squares estimation
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...
Isabelle Rivals, Léon Personnaz