| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Automatic Programming (I.2.2) > Automatic Analysis Of Algorithms (I.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-6 of 6
Reviews about "Automatic Analysis Of Algorithms (I.2.2...)":
|
Date Reviewed |
| |
Empirical hardness models: methodology and a case study on combinatorial auctions
Leyton-Brown K., Nudelman E., Shoham Y. Journal of the ACM 56(4): 1-52, 2009. Type: Article
It took a decade of work to turn a set of fresh ideas into a mature approach. This was the case with empirical hardness models, a new area in algorithmics, where machine learning is used to predict the computational cost of an algorith...
|
Jul 1 2010 |
| |
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem
Maaß M. Software--Practice & Experience 36(3): 305-331, 2006. Type: Article
Given a finite set of n strings, the multiple common substring problem is formulated either as the task of finding all strings common to each string in the set, or as the problem of finding the maximal length common ...
|
Nov 7 2007 |
| |
Statistical efficiency of adaptive algorithms
Widrow B., Taylor M. Neural Networks 16(5-6): 735-744, 2003. Type: Article
The efficiency of a learning algorithm applied to a set of variable weights is measured statistically over a number of experiments by averaging the ratio of the quality of the solution to the amount of data used in training the weights...
|
Oct 16 2003 |
| |
Automatic qualitative analysis of dynamic systems using piecewise linear approximations
Sacks E. Artificial Intelligence 41(3): 313-364, 1990. Type: Article
While the analysis of linear dynamic systems is well understood, its extension to nonlinear systems is still an art. The Piecewise Linear Reasoner (PLR) program presented in this paper can automate the qualitative analysis of separable...
|
Dec 1 1990 |
| |
Understanding and automating algorithm design
Kant E. IEEE Transactions on Software Engineering SE-11(11): 1361-1374, 1985. Type: Article
This paper is concerned with the general problem of automating the algorithm design process. At this stage, one must consider all such discussions as preliminary; much still needs to be understood before automation is possible. In this...
|
Aug 1 1986 |
| |
The roles of execution and analysis in algorithm design
Steier D., Kant E. IEEE Transactions on Software Engineering SE-11(11): 1375-1386, 1985. Type: Article
In this paper, the authors describe their research into the algorithm design process. They focus on the language for representing partially designed algorithms and on a process that can discover knowledge to guide the algorithm design....
|
Aug 1 1986 |
| |
|
|
| |
|
|
