1173 search results - page 24 / 235 » Identifying Successful Telecommuters |
CADE
1992
Springer
15 years 1 months ago
1992
Springer
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
101
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: Linkage Disequilibrium (LD) bin-tagging algorithms identify a reduced set of tag SNPs that can capture the genetic variation in a population without genotyping every s...
HICSS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper discusses a longitudinal study that explored the relationship between use of organizational memory and knowledge (OM/K) and knowledge worker productivity within the eng...
92
Voted
METRICS
1997
IEEE
15 years 1 months ago
1997
IEEE
Schlumberger RPS successfully applies software measurement to support their software development projects. It is proposed that the success of their measurement practices is mainly...
DISOPT
2008
14 years 9 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...