搜索结果: 1-15 共查到“计算数学 algorithms”相关记录35条 . 查询时间(0.188 秒)
Over the last decade, the computing needs of modern enterprise and industry have expanded to include machine intelligence, cloud computing, and HPC. In the next decade, these communities will rely on...
The First Symposium on Simplicity in Algorithms will be co-located with The 29th ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) in New Orleans, LA, USA, January 7–10, 2018.Symposium on Simplic...
三亚国际数学论坛：High Performance Numerical Algorithms and Applications
三亚国际数学论坛 High Performance Numerical Algorithms and Applications
2017/11/24
Scalable parallel algorithms for partial differential equations (PDEs) play a key role in computational science and engineering. As the number of processor cores in today's supercomputers grows rapidl...
Distributed Local Broadcasting Algorithms in the Physical Interference Model
Local Broadcasting Algorithms Physical Interference Model
2012/11/30
Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is to schedule all these re...
A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms
Lanczos Method Singular Value Decomposition Eigenvalue
2011/3/1
Recent years have witnessed the popularity of using rank minimization as a regularizer for various signal processing and machine learning problems.
Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
Lucas numbers algorithms iteration recursion Fibonacci
2011/3/1
A fast and simple O(log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a √5 conversion...
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
Hardness approximability exact algorithms vector domination total vector domination
2011/3/2
We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that any vertex outside S ...
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
Lattices Hasse diagrams border algorithms
2011/3/2
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to ar-bitrary lattices. In the case of iPred, this requires the identificatio...
The asymptotical error of broadcast gossip averaging algorithms
asymptotical error of broadcast gossip algorithms
2011/2/21
In problems of estimation and control which involve a network, efficient distributed computation of averages is a key issue.
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
Impact of Mutation-Selection Balance Runtime of Evolutionary Algorithms
2010/12/28
The interplay between mutation and selection plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this inter-play is still not completely understood.
Multiuser broadcast erasure channel with feedback - capacity and algorithms
Broadcast erasure channels feedback-based coding capacity achieving algorithms
2010/12/1
We consider the N-user broadcast erasure channel where feedback from the users is fed back to the transmitter in the form of ACK messages.
Dynamic programming based algorithms for set multicover and multiset
Set multicover Multiset multicover Inclusionexclusion Dynamic programming Algorithm
2012/11/30
Given a universe N containing n elements and a collection of multisets or sets over N, the multiset multicover (MSMC) problem or the set multicover (SMC) problem is to cover all elements at least a nu...
Holographic Algorithms With Unsymmetric Signatures
Holographic Algorithms Unsymmetric Signatures
2012/11/30
Holographic algorithms were introduced by Valiant as a new methodology to derive polynomial time algorithms. Here information
and computation are represented by exponential sums using the so-called s...
Holographic Algorithms With Unsymmetric Signatures
Holographic Algorithms Unsymmetric Signatures
2012/11/30
Holographic algorithms were introduced by Valiant as a new methodology to derive polynomial time algorithms. Here information and computation are represented by exponential sums using the so-called si...
More Efficient Algorithms for Closest String and Substring Problems
More Efficient Algorithms Closest Strings Substring Problems
2012/11/30
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and antisense drug design. For their importance, the two problems have been exten...