Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,081,324 papers from all fields of science
Search
Sign In
Create Free Account
SourceForge
Known as:
SFEE
, SourceForge (disambiguation)
SourceForge Enterprise Edition is a collaborative revision control and software development management system. It provides a front-end to a range of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Application lifecycle management
Bug tracking system
Fork (software development)
GForge Open Source Edition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Development of Distributed Research Center for analysis of regional climatic and environmental changes
E. Gordov
,
A. Shiklomanov
,
I. Okladnikov
,
A. Prusevich
,
A. Titov
2016
Corpus ID: 133184108
We present an approach and first results of a collaborative project being carried out by a joint team of researchers from the…
Expand
2014
2014
Practical benefits of aspect-oriented programming paradigm in discrete event simulation
M. Chibani
,
Brahim Belattar
,
Abdelhabib Bourouis
2014
Corpus ID: 55060091
Aspect-oriented modeling and simulation is a new approach which uses the separation of concerns principle to enhance the quality…
Expand
Highly Cited
2012
Highly Cited
2012
Generating Device-specific GPU Code for Local Operators in Medical Imaging
Richard Membarth
,
Frank Hannig
,
J. Teich
,
M. Körner
,
Wieland Eckert
IEEE International Parallel and Distributed…
2012
Corpus ID: 15131544
To cope with the complexity of programming GPU accelerators for medical imaging computations, we developed a framework to…
Expand
Review
2012
Review
2012
Measuring the similarity and relatedness of concepts in the medical domain: IHI 2012 tutorial overview
Ted Pedersen
,
Serguei V. S. Pakhomov
,
Bridget T. McInnes
,
Y. Liu
International Health Informatics Symposium
2012
Corpus ID: 2702433
The ability to quantify the degree to which concepts are similar or related to each other is a key component in many Natural…
Expand
Highly Cited
2011
Highly Cited
2011
Shift-Reduce CCG Parsing
Yue Zhang
,
S. Clark
Annual Meeting of the Association for…
2011
Corpus ID: 2739834
CCGs are directly compatible with binary-branching bottom-up parsing algorithms, in particular CKY and shift-reduce algorithms…
Expand
2011
2011
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Matt Groff
arXiv.org
2011
Corpus ID: 15166151
The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving…
Expand
2008
2008
A Graph-Based Approach for Ad hoc Task Composition Considering User Preferences and Device Capabilities
H. Mukhtar
,
D. Belaid
,
G. Bernard
IEEE Globecom Workshops
2008
Corpus ID: 44624657
Ad hoc user task composition involves automatic matching and selection of services across various devices in the pervasive…
Expand
Highly Cited
2007
Highly Cited
2007
SWARM: A Parallel Programming Framework for Multicore Processors
David A. Bader
,
Guojing Cong
IEEE International Parallel and Distributed…
2007
Corpus ID: 12794365
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor…
Expand
2004
2004
cctbx news: Geometry restraints and other new features
R. Grosse-Kunstleve
,
P. Afonine
,
P. Adams
2004
Corpus ID: 14202001
The Computational Crystallography Toolbox (cctbx, http://cctbx.sourceforge.net/) is the open-source component of the Phenix…
Expand
Highly Cited
2003
Highly Cited
2003
Automating Service Dependency Management in a Service-Oriented Component Model
H. Cervantes
,
R. Hall
2003
Corpus ID: 7018614
This paper describes a mechanism to automate service dependency management in a service-oriented component model. The impetus…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE