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

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,913
Next 10 →

Parallel Explicit and Implicit Control of Reaching

by Pietro Mazzoni, Nancy S. Wexler , 2009
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Load Balancing Parallel Explicit State Model Checking

by Rahul Kumar , 2004
"... ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
Abstract not found

Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves

by Pradeep Kumar Mishra, Palash Sarkar - In Advances in Cryptology — Asiacrypt 2003, volume LNCS , 2003
"... Abstract. One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We continue this line of research by obtaining parallel versions of such formulae. Our first contribution is to deve ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Abstract. One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We continue this line of research by obtaining parallel versions of such formulae. Our first contribution

Parallel Explicit Model Checking for Generalized Büchi Automata

by E. Renault, A. Duret-lutz, F. Kordon, D. Poitrenaud
"... Abstract. We present new parallel emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on an SCC enumeration, support generalized Büchi acceptance, and require no synchronization points nor repair procedures. A salient feature of our algorithms is the ..."
Abstract - Add to MetaCart
Abstract. We present new parallel emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on an SCC enumeration, support generalized Büchi acceptance, and require no synchronization points nor repair procedures. A salient feature of our algorithms

The CONSORT statement: revised recommendations for improving the quality of reports of parallel-group randomized trials,”

by MSc; David Moher , PhD, MBA; Kenneth F Schulz , Douglas G Altman - Journal of the American Medical Association, , 1987
"... To comprehend the results of a randomized, controlled trial (RCT), readers must understand its design, conduct, analysis, and interpretation. That goal can be achieved only through complete transparency from authors. Despite several decades of educational efforts, the reporting of RCTs needs improv ..."
Abstract - Cited by 787 (15 self) - Add to MetaCart
-up, and analysis). The diagram explicitly includes the number of participants, for each intervention group, that are included in the primary data analysis. Inclusion of these numbers allows the reader to judge whether the authors have performed an intention-to-treat analysis. In sum, the CONSORT statement

Understanding and using the Implicit Association Test: I. An improved scoring algorithm

by Anthony G. Greenwald, T. Andrew Poehlman, Eric Luis Uhlmann, Mahzarin R. Banaji, Anthony G. Greenwald - Journal of Personality and Social Psychology , 2003
"... behavior relations Greenwald et al. Predictive validity of the IAT (Draft of 30 Dec 2008) 2 Abstract (131 words) This review of 122 research reports (184 independent samples, 14,900 subjects), found average r=.274 for prediction of behavioral, judgment, and physiological measures by Implic ..."
Abstract - Cited by 632 (94 self) - Add to MetaCart
by Implicit Association Test (IAT) measures. Parallel explicit (i.e., self-report) measures, available in 156 of these samples (13,068 subjects), also predicted effectively (average r=.361), but with much greater variability of effect size. Predictive validity of self-report was impaired for socially

MULTILISP: a language for concurrent symbolic computation

by Robert H. Halstead - ACM Transactions on Programming Languages and Systems , 1985
"... Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing par ..."
Abstract - Cited by 529 (1 self) - Add to MetaCart
Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing

A Parallel Explicit/Implicit Time Stepping Scheme on Block-Adaptive Grids

by Gábor Tóth, Darren L. De Zeeuw, Tamas I. Gombosi, Kenneth G. Powell , 2005
"... We present a parallel explicit/implicit time integration scheme well suited for blockadaptive grids. The basic idea of the algorithm is that the time stepping scheme can differ in the blocks of the grid for a given time step: an explicit scheme is used in the blocks where the local stability require ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
We present a parallel explicit/implicit time integration scheme well suited for blockadaptive grids. The basic idea of the algorithm is that the time stepping scheme can differ in the blocks of the grid for a given time step: an explicit scheme is used in the blocks where the local stability

On Language and Connectionism: Analysis of a Parallel Distributed Processing Model of Language Acquisition

by Steven Pinker, Alan Prince - COGNITION , 1988
"... Does knowledge of language consist of mentally-represented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk/walked) ..."
Abstract - Cited by 415 (13 self) - Add to MetaCart
Does knowledge of language consist of mentally-represented rules? Rumelhart and McClelland have described a connectionist (parallel distributed processing) model of the acquisition of the past tense in English which successfully maps many stems onto their past tense forms, both regular (walk

Parallel Explicit State Reachability Analysis and State Space Construction

by Dana Petcu
"... An improvement is proposed for the algorithm described in [3] which allows the construction of the state space associated to a system. The improvement concerns the load balancing strategy. Different message-passing implementations on a cluster of workstations are also discussed. 1. ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
An improvement is proposed for the algorithm described in [3] which allows the construction of the state space associated to a system. The improvement concerns the load balancing strategy. Different message-passing implementations on a cluster of workstations are also discussed. 1.
Next 10 →
Results 1 - 10 of 3,913
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