搜索结果: 1-7 共查到“数学 machines”相关记录7条 . 查询时间(0.093 秒)
The standard 2-norm SVM is known for its good performance in twoclass classification. In this paper, we consider the 1-norm SVM. We argue that the 1-norm SVM may have some advantage over the standard ...
Solving Support Vector Machines in Reproducing Kernel Banach Spaces with Positive Definite Functions
support vector machine reproducing kernel Banach space reproducing kernel,posi-tive definite function Fourier transform,Sobolev space,Matern function,Sobolev spline
2012/11/22
In this paper we extend support vector machines from reproducing kernel Hilbert spaces into reproducing kernel Banach spaces whose reproducing kernels can be defined on nonsymmetric domains. Using the...
A Greedy Algorithm for Feedrate Planning of CNC Machines along Curved Tool Paths with Conned Jerk
Feedrate optimization parametric tool path conned jerk velocity limit surface analytical solutions for feedrate function
2013/9/9
In this paper, the problem of optimal feedrate planning along a curved tool path for 3-axis CNC machines with the acceleration and jerk limits for each axis and the tangential velocity bound is addres...
Online over time scheduling on unbounded p-batch machines to minimize the makespan: A survey
operation sresearch online scheduling parallel-batch machines makespan competitive ratio
2011/11/14
Online scheduling is a rapidly developed branch in scheduling theory. In the research of online scheduling, makespan minimization on unbounded parallel-batch machines is a fruitful area. In this paper...
Analysis of Casino Shelf Shuffling Machines
Casino Shelf Shuffling Machines Combinatorics Probability
2011/9/9
Abstract: Many casinos routinely use mechanical card shuffling machines. We were asked to evaluate a new product, a shelf shuffler. This leads to new probability, new combinatorics, and to some practi...
Randomized Truthful Mechanisms for Scheduling Unrelated Machines
Randomized Truthful Unrelated Machines
2012/12/3
In this paper, we consider randomized truthful mechanisms for scheduling tasks to unrelated machines, where each machine is controlled by a sel痵h agent. Some previous work on this topic focused on a s...
Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on two Uniform Machines
semi-online preemptive scheduling uniform machines competitive ratio
2007/12/11
In this paper, we consider the semi-online preemptive scheduling problem with known largest job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time...