搜索结果: 1-15 共查到“数学 Machine”相关记录15条 . 查询时间(0.066 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Machine learning methods for forward and inverse PDEs
正反向 偏微分方程 机器学习
2023/4/27
![](http://www.firstlight.cn/upload/imgfile/20236/20/2023620143457106.png)
![](http://www.firstlight.cn/upload/imgfile/20236/21/2023621101348481.png)
Tiny machine learning design alleviates a bottleneck in memory usage on internet-of-things devices(图)
林肯实验室 图开发 研讨会 网络科学 虚假信息追踪 机器学习
2023/6/21
2018集成机器学习和预测模拟研讨会(lntegrating Machine Learning and Predictive Simulatio)
2018 集成机器学习和预测模拟 研讨会
2017/12/20
Industrial design and engineering, as well as healthcare, are facing unprecedented challenges with product complexity and increasingly faster innovation cycles. On the one hand, advances in computer m...
The Entire Regularization Path for the Support Vector Machine
Entire Regularization Path Support Vector Machine
2015/8/21
In this paper we argue that the choice of the SVM cost parameter can be critical. We then derive an algorithm that can fit the entire path of SVM solutions for every value of the cost parameter, with ...
Solitaire: Man Versus Machine
Solitaire Man Machine
2015/7/8
Solitaire: Man Versus Machine。
Gene-centric gene-gene interaction: A model-based kernel machine method
Allele matching kernel association study gene-clustered SNPs genomic similarity reproducing kernel Hilbert space quantitative traits
2012/11/23
Much of the natural variation for a complex trait can be explained by variation in DNA sequence levels. As part of sequence variation, gene-gene interaction has been ubiquitously observed in nature, w...
Single machine scheduling with processing time functions of starting time or position
operations research scheduling single machine processing time function time dependent
2011/11/14
In this paper, two single machine scheduling models with general processing time functions are considered. Job's processing time is assumed to be basic processing time adds a function of starting time...
Nonsmooth Formulation of the Support Vector Machine for a Neural Decoding Problem
Nonsmooth Formulation Support Vector Machine Neural Decoding Problem
2011/1/18
This paper formulates a generalized classification algorithm with an applica-tion to classifying (or ‘decoding’) neural activity in the brain. Medical doctors and researchers have long been interested...
On electrical correlates of Physarum polycephalum spatial activity: Can we see Physarum Machine in the dark?
Physarum polycephalum plasmodium electric potential behaviour
2010/12/28
Plasmodium of Physarum polycephalum is a single cell visible by unaided eye, which spans sources of nutrients with its protoplasmic network.In a very simple experimental setup we recorded electric pot...
Nonsmooth Formulation of the Support Vector Machine for a Neural Decoding Problem
Nonsmooth Formulation the Support Vector Machine Neural Decoding Problem
2011/1/4
This paper formulates a generalized classification algorithm with an application to classifying (or `decoding') neural activity in the brain. Medical doctors and researchers have long been interested ...
Trade-off between time complexity and makespan for flexible flow-shop group scheduling problems with two machine centers
group scheduling flexible flow shop Johnson algorithm
2010/9/15
The flexible flow-shop group scheduling problem is investigated in this paper to minimize the makespan. Two algorithms have been proposed to solve the problem with two machine centers, which have the ...
This paper uses the geometric singular perturbationtheory to investigate dynamical behaviors and singularities in afundamental power system presented in a single-machineinfinite-bus formulation. The p...
Linear Time Algorithms for Parallel Machine Scheduling
scheduling design and analysis of algorithm worst-case ratio computer-aided proof
2007/12/11
This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm...
SEMI-ON-LINE SCHEDULING PROBLEMS FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME
On-line analysis of algorithm
2007/12/11
This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.