Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 21 - 30
of
37,955
Table 4 Classification of software inspection methods (adapted from Siy 1996, p. 18)
1999
Table 4{2: MSc 91/92 module information{continued
1992
"... In PAGE 36: ... The interval within the same half day is half an hour, however the interval between morning and afternoon is one hour. If there are seven days for the exams, then the time slots will be 28 and TIMETABLE AM PM 09:30-11:00 11:30-13:00 14:00-15:30 16:00-17:30 day of week Table4 {1: Actual time slots allocation... In PAGE 39: ...abbrev. course name 1 aied AI and Education 2 cvis Computational Vision 3 ias Intelligent Assembly Systems 4 isc Intelligent Sensing and Control 5 es Expert Systems 6 kri1 Knowledge Representation and Inference I 7 kri2 Knowledge Representation and Inference II 8 lisp Programming in Lisp 9 mvis Machine Vision 10 mthr Mathematical Reasoning 11 nlp Natural Language Processing 12 prol Programming in Prolog 13 essp Special Expert Systems Project 14 clg1 Computational Linguistics 1 15 clg2 Computational Linguistics 2 16 lng1 Linguistics 1 17 lng2 Linguistics 2 18 fsm1 Formal Semantics 1 19 nnet Neural Networks 20 sp1 Speech Processing 1 21 sp2 Speech Processing 2 22 os Operating Systems 23 db Database Systems 24 cpin Computability and Intractibility 25 swl Software for Parallel Computers Table4 {2: MSc 91/92 module information... ..."
Table 1: L amp;S vs. HYCAM on globally unsatisfiable instances (a) and on various difficult SAT instances (b)
"... In PAGE 4: ... In the following, a time-out limit has been set to 3 CPU hours. First, in Table1 a, we report experimental results about the computation of MSS on pigeon-hole and xor-chains bench- marks, which are globally unsatisfiable in the sense that re- moving any one of their clauses makes the instance become satisfiable. Obviously enough, such instances exhibit a num- IJCAI-07... In PAGE 5: ... On the contrary, L amp;S explores many more nodes in the search space to deliver the CoMSS. In Table1 b, experimental results on more difficult bench- marks from the annual SAT competition [SATLIB, 2000] are described. Their number of MSS is often exponential, and computing them often remains intractable.... ..."
Cited by 1
Table 5: Compute time in CPU seconds objects atts AODE NB TAN LBR J48
2002
"... In PAGE 5: ... 6.2 Relative Compute Time Table5 presents the total compute time of each algorithm by data set. These times are the total time to run Weka to complete the cross-validation task and hence include data input as well as learning and classification.... ..."
Cited by 7
Table 5: Demographic Information
2002
"... In PAGE 8: ...able 4 - List of Websites Reviewed ....................................................................................... 18 Table5 : Demographic Information.... ..."
Table I: Some vertex subset properties expressed as ( ; )-sets, with tractabil- ity/intractability cuto value for the partitioning problem (1 means tractable for all k values). We use an asterisk as reference if cuto value is proved in this paper.
Table 6 lists the four integer instructions we support as well as the symbolic execution that updates register values, Any other instructions that assign to an integer register are defined as in- tractable. If and only if a register used for addressing is modified by an intractable instruction in the middle of the basic block, we insert a snippet to store its value before modification. We cannot remove the instrumentation point after instruction 5 because reg- ister $19 has been changed intractably. For the block in Figure 1, we only need to explicitly instrument one memory instruction, the rest are captured at the end of the basic block.
"... In PAGE 6: ... Table6 : Instructions Supported for Symbolic Execution I 1 ldah$25,18($7) I 3 ldah$27,9($7) I 4 ldah$8,4($7) I 8 ldah$24,18($7) M 13 ldt$f16,25352($8) M 16 ldt$f15,-29536($24) M 17 ldl$8, 9($8) M 21 ldt$f11,25480($27) M 22 ldt$f14,10648($25) Figure 2: Register Aliasing Supported in Delayed Analysis Figure 2 shows an excerpt from a very common assembly se-... ..."
TABLE 4. ELASTICITY ESTIMATES FOR OO amp; RO DU MODELS OODU Price RODU Rent/Month
Table 5: The number of devices with different hub types.
"... In PAGE 7: ... Example II We use three Mac computers, four FireWire hard drives, one printer, one scanner and one camcorder, totally ten devices. To satisfy the connectivity condition, we add three, two, and one hub when using three-port, four-port, six-port hubs, respectively (first two rows in Table5 ). For the exhaustive approach, the problem of up to thir- teen nodes becomes intractable in practice.... In PAGE 7: ... For the exhaustive approach, the problem of up to thir- teen nodes becomes intractable in practice. Out algorithm gener- ated highly compact tree sets (Row 3 of Table5 ). Potential energy savings ranges 10.... ..."
Results 21 - 30
of
37,955
