Skip to search formSkip to main contentSkip to account menu

MINC

Known as: MINC (disambiguation) 
MINC ("MINC is not C") is a data specification language written in the mid-1980s by a Princeton University graduate student named Lars Graf. This… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
PerlPythonReal-time CmixTcl

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Classical boson sampling algorithms with superior performance to near-term experiments
A classical algorithm solves the boson sampling problem for 30 bosons with standard computing hardware, suggesting that a much… 
2017
2017
Meaningful communities detection in medias network
Most of the existing algorithms proposed for communities determination are based on the topological features of social networks… 
Highly Cited
2014
Highly Cited
2014
Numerical Simulation of Low Permeability Unconventional Gas Reservoirs
Unconventional gas resources from tight sand and shale gas reservoirs have received great attention in the past decade and become… 
2009
2009
Mininimum cardinality candidate generation
This paper describes the NGDE algorithm used for the 2009 DX Competition. This algorithm is based on new minimum cardinality… 
Highly Cited
2008
Highly Cited
2008
Welcoming a monster to the world: Myths, oral tradition, and modern societal response to volcanic disasters
Highly Cited
2004
Highly Cited
2004
Hydrogen Spillover to Enhance Hydrogen Storage -- Study of the Effect of Carbon Physicochemical Properties
2004
2004
Quand les normes font loi : Topologie intégrée et processus différenciés de la normalisation internationale
La normalisation internationale designe ici les specifications techniques volontaires intervenant dans la production et les… 
Highly Cited
2003
Highly Cited
2003
Associativity in combination of belief functions; a derivation of minC combination
Abstract The nature of a contradiction (conflict) between two belief functions is investigated. Alternative ways of distributing… 
Highly Cited
1985
Highly Cited
1985
Fragments of arithmetic
1972
1972
Sufficient conditions for the undecidability of intuitionistic theories with applications
Let Δ be a set of axioms of a theory Tc(Δ) of classical predicate calculus (CPC); Δ may also be considered as a set of axioms of… 
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)