Result 161 to 180 of 188 total
A knowledge crunching system (English)
ARCS, 9-21 (1990).
161
Minimisation d’une fonction convexe séparable avec contraintes de rapport entre les variables. (Minimization of a convex separable function with ratio constraints between the variables). (French)
RAIRO, Rech. Opér. 23, No.4, 305-317 (1989).
162
Finiteness conditions on subgroups and formal language theory. (English)
Proc. Lond. Math. Soc., III. Ser. 58, No.1, 74-88 (1989).
163
Distance between objects represented by octtrees defined in different coordinate systems (English)
Computers & Graphics 13, No. 4, 497-503 (1989).
164
Computation of delay defect and delay fault probabilities using a statistical timing simulator (English)
ITC, 153-160 (1989).
165
Timing verification by formal signal interaction modeling in a multi-level timing simulator (English)
DAC, 668-673 (1989).
166
Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows. (English)
Manage. Sci. 34, No.8, 1005-1022 (1988).
167
A new approach to hierarchical and statistical timing simulations. (English)
IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 6, No. 6, 1039-1052 (1987).
168
An efficient implementation of the “Partan” variant of the linear approximation method for the network equilibrium problem. (English)
Networks 17, No.3, 319-339 (1987).
169
The foundations of program verification. In collab. with Ryan D. Stansifer. 2nd ed. ii. (English)
Wiley-Teubner Series in Computer Science. Stuttgart: B. G. Teubner; Chichester etc.: John Wiley \& Sons. IX, 230 p.; DM 58.00 (1987).
170
An object oriented extension to APL (English)
APL, 128-137 (1987).
171
ICM3: design and evaluation of an inference chrunching machine (English)
IWDM, 3-16 (1987).
172
Methods for routing with time windows. (English)
Eur. J. Oper. Res. 23, 236-245 (1986).
173
Routing with time windows by column generation. (English)
Networks 14, 545-565 (1984).
174
Error bounds for the analysis by decomposition of non-negative matrices (English)
Computer Performance and Reliability, 209-224 (1983).
175
Décomposition de la somme cartesienne d’un cycle et de l’union de deux cycles hamiltoniens en cycles hamiltoniens. (French)
J. Comb. Theory, Ser. B (to appear).
176
Décomposition de la somme cartesienne d’un cycle et de l’union de deux cycles hamiltoniens en cycles hamiltoniens. (French)
Discrete Math. 38, 7-16 (1982).
177
Graphes orientes indécomposables en circuits hamiltoniens (English)
J. Comb. Theory, Ser. B 32, No. 3, 347-349 (1982).
178
Décomposition de $K\sb m$ + $K\sb n$ en cycles hamiltoniens. (French)
Discrete Math. 37, 19-27 (1981).
179
A case study in program transformation: Translation into Polish. (English)
IEEE Trans. Software Eng. 5, 593-606 (1979).
180
Result 161 to 180 of 188 total
Start
Contact
Print
General Help
