Sciweavers

13099 search results - page 2231 / 2620
» Cooperative method development
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
15 years 6 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
AEI
2005
99views more  AEI 2005»
15 years 6 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
IJNSEC
2007
161views more  IJNSEC 2007»
15 years 6 months ago
Data Hiding: Current Status and Key Issues
Image steganography is a covert communication method that uses an image as the cover to hide the truth from potential attackers that some secret message hidden in the image is bei...
Nan-I Wu, Min-Shiang Hwang
SOCO
2008
Springer
15 years 6 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima
SYNTHESE
2008
84views more  SYNTHESE 2008»
15 years 6 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
« Prev « First page 2231 / 2620 Last » Next »