Sciweavers

17329 search results - page 155 / 3466
» Improved non-approximability results
Sort
View
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
14 years 2 months ago
A New Approach to Improve Particle Swarm Optimization
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
Liping Zhang, Huanjun Yu, Shangxu Hu
IJCNN
2000
IEEE
14 years 1 months ago
Improved Rotational Invariance for Statistical Inverse in Electrical Impedance Tomography
In this paper we show that rotational invariance can be improved in a neural network based EIT reconstruction approach by a suitably chosen permutation of the input data. The inpu...
Jani Lahtinen, Tomas Martinsen, Jouko Lampinen
AI
2000
Springer
14 years 1 months ago
Learning Rewrite Rules versus Search Control Rules to Improve Plan Quality
Domain independent planners can produce better-quality plans through the use of domain-speci c knowledge, typically encoded as search control rules. The planning-by-rewriting appro...
Muhammad Afzal Upal, Renee Elio
VLSID
1999
IEEE
97views VLSI» more  VLSID 1999»
14 years 1 months ago
Improving Area Efficiency of Residue Number System based Implementation of DSP Algorithms
Residue Number System based applications involve modulo-arithmetic which is typically implemented using look-up-tables (LUTs) for a small value of modulus. In this paper, we prese...
M. N. Mahesh, Satrajit Gupta, Mahesh Mehendale
LATIN
1998
Springer
14 years 1 months ago
Improved Approximate Pattern Matching on Hypertext
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
Gonzalo Navarro