Search results for "METHODOLOGIE"

showing 10 items of 2141 documents

More Power through Symbolic Computation: Extending Stata by using the Maxima Computer algebra system

2015

Maxima is a free and open-source computer algebra system that can perform symbolic computations such as solving equations, determining derivatives of functions, obtaining Taylor series, and manipulating algebraic expressions. In this article, I present the Maxima Bridge System, which is a collection of software programs that allows Stata to interface with Maxima so that Maxima can be used for symbolic computation to transfer data from Stata to Maxima and to retrieve results from Maxima. The cooperation between Stata and Maxima provides an environment for statistical analysis in which symbolic computation can be easily used together with all the facilities supplied by Stata. In this environ…

Theoretical computer sciencebusiness.industryComputationInterface (computing)Symbolic computationsymbols.namesakeMathematics (miscellaneous)SoftwareComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONTaylor seriessymbolsAlgebraic expressionbusinessMaximaAlgorithmMathematicsEquation solvingThe Stata Journal: Promoting communications on statistics and Stata
researchProduct

Representations for evolutionary algorithms

2015

Successful and efficient use of evolutionary algorithms (EA) depends on the choice of the genotype, the problem representation (mapping from genotype to phenotype) and on the choice of search operators that are applied to the genotypes. These choices cannot be made independently of each other. The question whether a certain representation leads to better performing EAs than an alternative representation can only be answered when the operators applied are taken into consideration. The reverse is also true: deciding between alternative operators is only meaningful for a given representation. In EA practice one can distinguish two complementary approaches. The first approach uses indirect repr…

Theoretical computer sciencebusiness.industryComputer scienceEvolutionary algorithmRepresentation (systemics)Genetic programming0102 computer and information sciences02 engineering and technologyComputingMethodologies_ARTIFICIALINTELLIGENCEPhenotype01 natural sciencesOperator (computer programming)Grammatical evolution010201 computation theory & mathematicsGenetic algorithmGenotype0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingGenetic representationArtificial intelligencebusinessProceedings of the Genetic and Evolutionary Computation Conference Companion
researchProduct

High Locality Representations for Automated Programming

2011

We study the locality of the genotype-phenotype mapping used in grammatical evolution (GE). GE is a variant of genetic programming that can evolve complete programs in an arbitrary language using a variable-length binary string. In contrast to standard GP, which applies search operators directly to phenotypes, GE uses an additional mapping and applies search operators to binary genotypes. Therefore, there is a large semantic gap between genotypes (binary strings) and phenotypes (programs or expressions). The case study shows that the mapping used in GE has low locality leading to low performance of standard mutation operators. The study at hand is an example of how basic design principles o…

Theoretical computer sciencebusiness.industryComputer scienceLocalityParse treeGenetic programmingcomputer.software_genreComputingMethodologies_ARTIFICIALINTELLIGENCEGrammatical evolutionLocal search (optimization)Edit distanceArtificial intelligenceHeuristicsbusinesscomputerNatural language processingSemantic gap
researchProduct

On the use of neighbourhood-based non-parametric classifiers

1997

Alternative non-parametric classification schemes, which come from the use of different definitions of neighbourhood, are introduced. In particular, the Nearest Centroid Neighbourhood along with the neighbourhood relation derived from the Gabriel Graph and the Relative Neighbourhood Graph are used to define the corresponding (k-)Nearest Neighbour-like classifiers. Experimental results are reported to compare the performance of the approaches proposed here to the one obtained with the k-Nearest Neighbours rule.

Theoretical computer sciencebusiness.industryGabriel graphNonparametric statisticsCentroidPattern recognitionClassification schemeNeighbourhood graphComputingMethodologies_PATTERNRECOGNITIONNeighbourhood components analysisArtificial IntelligenceSignal ProcessingNeighbourhood systemComputingMethodologies_GENERALComputer Vision and Pattern RecognitionArtificial intelligencebusinessNeighbourhood (mathematics)SoftwareMathematics
researchProduct

Lógicas epistémicas y sistemas multiagentes: los agentes nacen y mueren

2008

In this paper we study the propositional epistemic logics with operators to analize the knowledge of a group, and its applications to the multi-agent systems when the number of agents can vary between different worlds or states.

TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESCiencias básicas y experimentalesUNESCO::FILOSOFÍA:FILOSOFÍA [UNESCO]HumanidadesHª y Fª de la CienciaFilosofía. EticaComputingMethodologies_ARTIFICIALINTELLIGENCE
researchProduct

MOESM2 of Global mapping of randomised trials related articles published in high-impact-factor medical journals: a cross-sectional analysis

2020

Additional file 2. Data extraction and normalisation processes.

TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONData_FILES3. Good health
researchProduct

MOESM2 of Global mapping of randomised trials related articles published in high-impact-factor medical journals: a cross-sectional analysis

2020

Additional file 2. Data extraction and normalisation processes.

TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONData_FILES3. Good health
researchProduct

Negative results in the theory of games with lexicographic utilities

2003

When players may have lexicographic utilities, there are: (i) extensive games having a non-empty set of equilibria but empty sets of sequentially rational, sequential and perfect equilibria (ii) normal form games having a non-empty set of equilibria but an empty set of proper equilibria and no stable set of equilibria and (iii) two extensive games having the same normal form representation and disjoint sets of sequential equilibria.

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Logic in Computer ScienceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALlexicographic expected utilityComputer Science::Formal Languages and Automata Theoryjel:C7Economics Bulletin
researchProduct

Additional file 4 of Are small protected habitat patches within boreal production forests effective in conserving species richness, abundance and com…

2021

Additional file 4. Search strings. Full search strings in English and Russian, and simplified search strings for Google and Google Scholar in English, Russian, Swedish and Finnish.

TheoryofComputation_MISCELLANEOUSComputingMethodologies_DOCUMENTANDTEXTPROCESSINGComputerApplications_COMPUTERSINOTHERSYSTEMSGeneralLiterature_MISCELLANEOUS
researchProduct

Additional file 2 of Efficacy and acceptability of pharmacological and non-pharmacological interventions for non-specific chronic low back pain: a pr…

2020

Additional file 2. MEDLINE search string.

TheoryofComputation_MISCELLANEOUSComputingMethodologies_PATTERNRECOGNITIONInformationSystems_INFORMATIONSTORAGEANDRETRIEVALData_FILES
researchProduct