نتایج جستجو برای: benchmark functions

تعداد نتایج: 544592  

This paper proposes the refined first order shear deformation theory to investigate the free vibration behavior of bidirectional functionally graded porous plates. This theory satisfies the transverse shear stress free conditions at the top and bottom of the plate, thus avoids the need of a shear correction factor. The rule of mixtures is employed to compute the effective material properties an...

Journal: :Knowl.-Based Syst. 2015
Hamid Salimi

Evolutionary Algorithms (EAs) are well-known terms in many science fields. EAs usually interfere with science problems when common mathematical methods are unable to provide a good solution or finding the exact solution requires an unreasonable amount of time. Nowadays, many EA methods have been proposed and developed. Most of them imitate natural behavior, such as swarm animal movement. In thi...

2016
Christoph Pinkel Ernesto Jiménez-Ruiz

This manual is addressed to users of the RODI benchmark suite [1], who intend to run the benchmark for evaluating some mapping generation system. RODI is designed to test the quality of (semi-) automatically generated mappings between relational schemata and ontologies. It includes a benchmark framework, test scenarios, a scoring function and reporting, as well as an extension mechanism to add ...

2010
Abhay Harpale Yiming Yang

In this paper, we propose an Active Learning (AL) framework for the Multi-Task Adaptive Filtering (MTAF) problem. Specifically, we explore AL approaches to rapidly improve an MTAF system, based on Dirichlet Process priors, with minimal user/task-level feedback. The proposed AL approaches select instances for delivery with a two-fold objective: 1) Improve future task-specific system performance ...

2013
David Zilian Christoph A. Sotriffer

SFCscore is a collection of emprirical scoring functions derived from a set of over 60 descriptors for protein-ligand complexes of known structure [1]. By the time of their derivation, SFCscore functions were the best-performing scoring functions tested on large heterogeneous data sets, but the overall correlation was still not within the desired range. Similarly, despite the ever increasing am...

2015
Ruty Rinott Lena Dankin Carlos Alzate Perez Mitesh M. Khapra Ehud Aharoni Noam Slonim

Engaging in a debate with oneself or others to take decisions is an integral part of our day-today life. A debate on a topic (say, use of performance enhancing drugs) typically proceeds by one party making an assertion/claim (say, PEDs are bad for health) and then providing an evidence to support the claim (say, a 2006 study shows that PEDs have psychiatric side effects). In this work, we propo...

2016
Patrick Verga Andrew McCallum

Universal schema jointly embeds knowledge bases and textual patterns to reason about entities and relations for automatic knowledge base construction and information extraction. In the past, entity pairs and relations were represented as learned vectors with compatibility determined by a scoring function, limiting generalization to unseen text patterns and entities. Recently, ‘column-less’ vers...

2004
Sofus A. Macskassy Foster J. Provost

In this paper we study techniques for generating and evaluating confidence bands on ROC curves. ROC curve evaluation is rapidly becoming a commonly used evaluation metric in machine learning, although evaluating ROC curves has thus far been limited to studying the area under the curve (AUC) or generation of one-dimensional confidence intervals by freezing one variable—the false-positive rate, o...

Journal: :Bioinformatics 2008
Shiyong Liu Ying Gao Ilya A. Vakser

UNLABELLED A protein-protein docking decoy set is built for the Dockground unbound benchmark set. The GRAMM-X docking scan was used to generate 100 non-native and at least one near-native match per complex for 61 complexes. The set is a publicly available resource for the development of scoring functions and knowledge-based potentials for protein docking methodologies. AVAILABILITY The decoys...

Journal: :Soft Comput. 2016
Craig Brown Yaochu Jin Matthew Leach Martin Hodgson

This paper proposes a new differential evolution (DE) algorithm for unconstrained continuous optimisation problems, termed μJADE, that uses a small or ‘micro’ (μ) population. The main contribution of the proposed DE is a new mutation operator, ‘current-by-rand-to-pbest.’ With a population size less than 10, μJADE is able to solve some classical multimodal benchmark problems of 30 and 100 dimens...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید