搜索结果: 76-90 共查到“理学 algorithms”相关记录191条 . 查询时间(0.045 秒)
Convergence of distributed asynchronous learning vector quantization algorithms
Convergence of distributed asynchronous vector quantization algorithms
font style='font-size:12px;'>
2011/2/25
Motivated by the problem of effectively executing clustering algo-rithms on very large data sets, we address a model for large scale dis-tributed clustering methods.
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
Hardness approximability exact algorithms vector domination total vector domination
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Effective hybrid evolutionary computational algorithms for global optimization and applied to construct prion AGAAAAGA fibril models
Effective hybrid evolutionary computational algorithms global optimization construct prion AGAAAAGA fibril models
font style='font-size:12px;'>
2011/3/4
Evolutionary algorithms are parallel computing algorithms and simulated annealing algorithm is a sequential computing algorithm.
Convergence of distributed asynchronous learning vector quantization algorithms
distributed asynchronous vector quantization algorithms
font style='font-size:12px;'>
2011/1/4
Motivated by the problem of effectively executing clustering algorithms on very large data sets, we address a model for large scale distributed clustering methods. To this end, we briefly recall some ...
Regularized Least-Mean-Square Algorithms
Least-Mean-Square Algorithms
font style='font-size:12px;'>
2011/1/4
We consider adaptive system identification problems with convex constraints and propose a family of regularized Least-Mean-Square (LMS) algorithms. We show that with a properly selected regularization...
Effective hybrid evolutionary computational algorithms for global optimization and applied to construct prion AGAAAAGA fibril models
Effective hybrid evolutionary computational algorithms global optimization
font style='font-size:12px;'>
2011/1/6
Evolutionary algorithms are parallel computing algorithms and simulated annealing algorithm is a sequential computing algorithm. This paper inserts simulated annealing into evolutionary computations a...
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms
Mutation-Selection Evolutionary Algorithms
font style='font-size:12px;'>
2011/1/6
The interplay between mutation and selection plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is still not completely understood. This paper presents...
The asymptotical error of broadcast gossip averaging algorithms
asymptotical error of broadcast gossip algorithms
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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.
Comparing parallel and simulated tempering enhanced sampling algorithms at phase transition regimes
parallel tempering simulated tempering first-order phase transitions Ising and lattice-gas models
font style='font-size:12px;'>
2010/11/19
Two important enhanced sampling algorithms, simulated (ST) and parallel (PT) tempering,are commonly used when ergodic simulations may be hard to achieve, e.g, due to a phase space separated by large f...
Evaluation of Compton scattering sequence reconstruction algorithms for a portable position sensitive radioactivity detector based on pixelated Cd(Zn)Te crystals
Evaluation of Compton scattering sequence reconstruction algorithms a portable position sensitive radioactivity detector based on pixelated Cd(Zn)Te crystals
font style='font-size:12px;'>
2011/1/4
We present extensive simulation studies on the performance of algorithms for the Compton sequence reconstruction used for the development of a portable spectroscopic instrument (COCAE), with the capab...
Many Roads to Synchrony: Natural Time Scales and Their Algorithms
Chaotic Dynamics (nlin.CD) Formal Languages and Automata Theory (cs.FL) Information Theory (cs.IT) Dynamical Systems (math.DS)
font style='font-size:12px;'>
2010/11/10
We survey the variety of ways in which one synchronizes to a stochastic process. We define associated length scales, providing characterization theorems and efficient algorithms for their calculation....
Fast algorithms for computing defects and their derivatives in the Regge calculus
Fast algorithms defects derivatives Regge calculus
font style='font-size:12px;'>
2010/12/20
Any practical attempt to solve the Regge equations, these being a large system of non-linear algebraic equations, will almost certainly employ a Newton-Raphson like scheme. In such cases it is essenti...
BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
BFACF-style algorithms polygons face-centered cubic lattices
font style='font-size:12px;'>
2010/11/23
In this paper the elementary moves of the BFACF-algorithm [1,2, 5] for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centred (BCC) and...