• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 17,630
Next 10 →

Table 3 Elegible persons in the comparion group Men Women Total

in Matching and Selection Methods to Measure the Impact on Wages of Training Programs for Unemployed Workers: Evaluating the Effectiveness of the Mexican
by Angel Calderón-madrid, Centro De Estudios Económicos, El Colegio De México

Table 5.4: Excerpt of the software case for the product GoPhone Elegance .

in Title Software Case Marking Language Definition Subtitle
by Workpackage Wp, Author(s Daniel Bildhauer, Jürgen Ebert, Volker Riediger, Katharina Wolter, Markus Nick Andreas Jedlitschka, Albert Ambroziewicz, Jacek Bojarski, Tomasz Straszak, Sevan Kavaldjian, Er Szep, Daniel Bildhauer, Hannes Schwarz, Katharina Wolter, Ebert Hannes Schwarz

Table 5.2: Theoretical performance: ratio of loads and stores over the number of basic operations c+ = a b. that the values in scalar variables will be reused across sub-problem, even if the local problem might not be optimally solved. This approach is automated and we can investigate the solution space and achieve an estimation of performance by counting the number of loads and stores with respect of the number of basic operations c+ = a b. This measure o ers a partial, but indicative, estimation of performance. We show in the following Table 5.2 a comparison among three di erent algorithms for register allocation. With Tiling we indicate an approach based on the most common tiling technique used on caches but with an exhaustive search (See page 77). Table 5.2 represents a architecture with a 32 registers le. This technique is an elegant extension of the fractal approach to the register le and, in fact, it is the implementation of the same idea at every level of the memory hierarchy. This approach is a general approach to data locality. The major disadvantage is the explosion in size of the code. For small problems and for big enough instruction cache the technique

in Performance Evaluation of Data Locality Exploitation
by Paolo D'Alberto, Mura Anteo Zamboni

Table 1. Deflection models for cantilever beams.

in DETC2004-57746 A KNOWLEDGE REPOSITORY FOR BEHAVIORAL MODELS IN ENGINEERING DESIGN
by Gregory Mocko, Christiaan Paredis, Richard Malak, Russell Peak 2004
"... In PAGE 6: ... 4.5 Behavior Model Example To illustrate the behavioral models knowledge representation proposed in this research, a simple cantilever beam example is presented (see Table1 ). The actual behavior models published in the repository can vary from simple, such as the cantilever beam, to highly complex FEA-based behavior models.... In PAGE 7: ...beam are presented in Table1 . The deflection behavior model are developed using the fundamentals of Mechanics of Materials.... In PAGE 7: ... The combination of Perl and HTML forms make an elegant and quick solution for deploying a proof- of-concept behavior model repository (see Figure 6). The description of the cantilever beam model in Table1 and Table 2 are mapped to the concepts for describing behavioral model (see Table 3). Behavioral modeling developers publish models to the repository through web-based HTML forms.... ..."

Table 3: First vehicle then crew scheduling

in An Exact Algorithm for the Vehicle and Crew Scheduling Problem
by Christian Friberg, Knut Haase 1999
Cited by 1

Table 3: First vehicle then crew scheduling

in An Exact Algorithm for the Vehicle and Crew Scheduling Problem
by Christian Friberg, Christian Friberg, Knut Haase, Knut Haase 1999
Cited by 1

Table 4 Classification results with different reducts 1: Number of rules; 2: Classification accuracy POSAR CEAR DISMAR GAAR PSORSAR

in Feature Selection based on Rough Sets and Particle Swarm Optimization
by Xiangyang Wang A, Jie Yang A, Xiaolong Teng A, Weijun Xia B, Richard Jensen C
"... In PAGE 25: ... So, all the particles have a powerful search capability, which can help the swarm avoid dead ends. The comparison of the number of decision rules and the classification accuracy with different reducts are shown in Table4... ..."

Table 2. Assessment criteria for story pass on and story chameleon (Narrative mode) Category Criteria Description Mechanical Elegant words Using appropriate words and phrases Organization Clear paragraph Making a clear paragraph

in Web-Based Interactive Writing Environment: Development and Evaluation
by Jie Chi Yang, Hwa Wei Ko, I Ling Chung 2005
Cited by 1

TABLE I COMPARISON OF REPRESENTATION METHODS.

in A Hierarchical Object Based Representation for Simultaneous Localization and Mapping
by Chieh-Chih Wang, Charles Thorpe 2004
Cited by 3

Table 5: Computational results for Example 1 for constant processing times. MILP STN Model MILP/CP Hybrid Scheme

in A Hybrid MILP/CP Decomposition Approach for the Continuous Time Scheduling of . . .
by Christos T. Maravelias, Ignacio E. Grossmann 2004
"... In PAGE 28: ...ith 13 time points, while instances Ms2 and Ms3 were solved for various time grids (i.e. no of time points) but no integer feasible solution was found in 36,000 CPU seconds. The computational statistics reported in Table5 , correspond to the MILP with the minimum number of time points that can represent the optimal solution found by the hybrid algorithm. The proposed algorithm, on the other hand, obtained the optimal solution for all instances of both objectives.... ..."
Cited by 7
Next 10 →
Results 11 - 20 of 17,630
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University