Sciweavers

707 search results - page 41 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
ISNN
2004
Springer
14 years 1 months ago
Evolving Flexible Neural Networks Using Ant Programming and PSO Algorithm
A flexible neural network (FNN) is a multilayer feedforward neural network with the characteristics of: (1) overlayer connections; (2) variable activation functions for different...
Yuehui Chen, Bo Yang, Jiwen Dong
CCE
2004
13 years 7 months ago
Stochastic maximum principle for optimal control under uncertainty
Optimal control problems involve the difficult task of determining time-varying profiles through dynamic optimization. Such problems become even more complex in practical situatio...
Vicente Rico-Ramírez, Urmila M. Diwekar
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 7 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
NCA
2008
IEEE
13 years 7 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
SIGSOFT
2005
ACM
14 years 8 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta