881 |
A distributed and-or parallel Prolog networkWrench, Karen Lee January 1990 (has links)
No description available.
|
882 |
Models of modularity : a study of object-oriented programmingYelland, Phillip M. January 1991 (has links)
No description available.
|
883 |
A method of program refinementGrundy, Jim January 1993 (has links)
No description available.
|
884 |
Strategy generation and evaluation for meta-game playingPell, Barney Darryl January 1993 (has links)
No description available.
|
885 |
Studies of and/or parallelism in PrologShen, Kish January 1992 (has links)
No description available.
|
886 |
A fast and expert machine translation system involving Arabic languageIbrahim-Sakre, Mohammed M. A. January 1991 (has links)
No description available.
|
887 |
Combinatorial Bin Packing ProblemsNielsen, Torben Noerup January 1985 (has links)
In the past few years, there has been a strong and growing interest in evaluating the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. The packing must be done in such a way that the sum of the sizes of the items into a given bin does not exceed the capacity of that bin. Moreover, an item must either be packed into a bin in its entirety or not at all: this "all or nothing" requirement is why these problems are characterized as being combinatorial. The objective of the packing is to optimize a given criterion Junction. Here optimize means either maximize or minimize, depending on the problem. We study two problems that fit into this framework: the Knapsack Problem and the Minimum Sum of Squares Problem. Both of these problems are known to be in the class of NP-hard problems and there is ample reason to suspect that these problems do not admit of efficient exact solution. We obtain results concerning the performance of heuristics under the assumption that the inputs are random samples from some distribution. For the Knapsack Problem, we develop four heuristics, two of which are on-line and two off-line. All four heuristics are shown to be asymptotically optimal in expectation when the item sizes and value ratios are assumed to be independent and uniform. One heuristic is shown to be asymptotically optimal in expectation when the item sizes are uniformly distributed and the value ratios are exponentially distributed. The amount of time required by these heuristics is no more than proportional to the amount of time required to sort the items in order of nonincreasing value ratios. For the Minimum Sum of Squares Problem, we develop two heuristics, both of which are off-line. Both of these heuristics are shown to be asymptotically optimal in expectation when the sizes of the items input are assumed uniformly distributed.
|
888 |
Reading techniques for object-oriented code of productionDunsmore, Alastair Peter January 2003 (has links)
No description available.
|
889 |
Database tools for multi-language program support environmentsMariani, J. A. January 1983 (has links)
No description available.
|
890 |
Expert systems in process designAjayi-obe, Yomi January 1989 (has links)
No description available.
|
Page generated in 0.1124 seconds