Results 21 - 30 of 34,211

Table 2: Neo-informal scenarios

in Freedom Of Association, Collective Bargaining And Informalization Of Employment: Some Issues
by Manuela Tomei International, Manuela Tomei

TABLE I COMPARISON OF NEO, Astir AND Astute

in Combining Ordered Best-First Search with Branch and Bound for Exact BDD Minimization
by Rüdiger Ebendt, Wolfgang Günther, Rolf Drechsler

Table 1: The number of submissions through each interface to NEOS since the August, 2005, release of NEOS version 5.

in unknown title
by unknown authors 2007
"... In PAGE 14: ...retrieving results, and setting up new solvers to run on NEOS. This API is new to NEOS, but as can be seen in Table1 , it already comprises almost one- sixth of all new NEOS job submissions. This number does not mean that one-sixth of all users are using this interface, however, because the ability to auto- mate submissions allows a minority of NEOS users to skew the statistics by easily submitting hundreds or in some cases even thousands of jobs to the NEOS server.... ..."

Table 3. (Continued)

in NORMAL BASES VIA GENERAL GAUSS PERIODS
by Sandra Feisel, Joachim Von, Zur Gathen, M. Amin Shokrollahi
"... In PAGE 14: .... FEISEL, J. VON ZUR GATHEN, AND M. A. SHOKROLLAHI Table3 . Improvements for q =3and2 n 400 n p(3;n) g(3;n)ratio r K 2 212.... In PAGE 16: .... FEISEL, J. VON ZUR GATHEN, AND M. A. SHOKROLLAHI Table3 . (Continued) n p(3;n) g(3;n)ratio r K 332 824.... ..."

Table 1: The von Neumann-Halperin Algorithm

in Scalable algorithms for aggregating disparate forecasts of probability
by J. B. Predd, S. R. Kulkarni, H. V. Poor 2006
Cited by 2

Table 1: Beobachtete Typen von Aussprachevarianten

in Regelbasiert generierte Aussprachevarianten für Spontansprache
by Thomas Kemp

Table 4: FEA Von Mises Results

in unknown title
by unknown authors

Table III. Computation times in seconds and number of iterations for minimum cost and minimum makespan problems, using the Ben- ders method. Each figure represents the aver- age of 5 instances.

in A hybrid method for planning and scheduling
by J. N. Hooker 2004
Cited by 15

Table IV. Computation times in seconds and number of iterations for minimum cost and minimum makespan problems, using the Ben- ders method. Each figure represents the aver- age of 5 instances.

in A hybrid method for planning and scheduling
by J. N. Hooker 2004
Cited by 15

Table 5.8: Results comparing LANCELOT, CSAAT ID and CSAGAAT ID in solving discrete constrained NLPs derived from selected continuous problems in CUTE, using the starting point speci ed in each problem. All times are in seconds on a Pentium-III 600-MHz computer running Solaris 7. 0 0 means that no feasible solution can be found by both the public version (01/05/2000) and the commercial version of LANCELOT (by submitting problems through the Internet, http://www-neos.mcs.anl.gov/neos/solvers/NCO:LANCELOT/). Boxed num- bers represent the best solutions among the three methods if they have di erent solutions.

in Optimal Anytime Search for Constrained Nonlinear Programming
by Yixin Chen, Yixin Chen 2001
Cited by 6
Results 21 - 30 of 34,211