Sciweavers

206 search results - page 24 / 42
» Simplifying failure-inducing input
Sort
View
175
Voted
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
16 years 22 hour ago
An online implementable differential evolution tuned optimal guidance law
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
Raghunathan Thangavelu, S. Pradeep
IJCNN
2000
IEEE
15 years 10 months ago
Design and Evaluation of Neural Networks for Coin Recognition by Using GA and SA
In this paper, we propose a method to design a neural network(NN) by using a genetic algorithm(GA) and simulated annealing(SA). And also, in order to demonstrate the effectivenes...
Yasue Mitsukura, Minoru Fukumi, Norio Akamatsu
ICIP
2003
IEEE
16 years 7 months ago
Robust background estimation for complex video sequences
Knowing the background image of a video scene simplifies the general video-object segmentation problem and therefore it is required by several automatic segmentation algorithms. T...
Dirk Farin, Peter H. N. de With, Wolfgang Effelsbe...
CHI
2002
ACM
16 years 6 months ago
The context fabric: an infrastructure for context-aware computing
Despite many sensor, hardware, networking, and software advances, it is still quite difficult to build effective and reliable context-aware applications. We propose to build a con...
Jason I. Hong
133
Voted
DCC
2007
IEEE
16 years 5 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...