搜索结果: 1-8 共查到“计算机科学技术 approximate”相关记录8条 . 查询时间(0.078 秒)
Trinary-Projection Trees for Approximate Nearest Neighbor Search
Approximate nearest neighbor search KD trees trinary-projection trees
font style='font-size:12px;'>
2016/1/23
We address the problem of approximate nearest neighbor (ANN) search for visual descriptor indexing. Most spatial partition trees, such as KD trees, VP trees and so on, follow the hierarchical binary s...
Fair Enough: Guaranteeing Approximate Maximin Shares
Fair division Computational social choice
font style='font-size:12px;'>
2016/1/22
We consider the problem of fairly allocating indivisible goods, focusing on a recently-introduced notion of fairness called maximin share guarantee: Each player’s value for his allocation should be at...
State Evolution for General Approximate Message Passing Algorithms, with Applications to Spatial Coupling
Messaging algorithm high dimensional behavior gaussian matrix generalized AMP
font style='font-size:12px;'>
2015/8/21
We consider a class of approximated message passing (AMP) algorithms and characterize their high-dimensional behavior in terms of a suitable state evolution recursion. Our proof applies to Gaussian ma...
Tractable approximate robust geometric programming
Geometric programming linear programming piecewise-linear function robust geometric programming robust linear programming robust optimization
font style='font-size:12px;'>
2015/8/10
The optimal solution of a geometric program (GP) can be sensitive to variations in the problem data. Robust geometric programming can systematically alleviate the sensitivity problem by explicitly inc...
An upwinded state approximate Riemann solver
upwinded state approximate Riemann solver
font style='font-size:12px;'>
2015/7/3
Stability is achieved in most approximate Riemann solvers through ‘flux upwinding’, where the flux at the interface is arrived at by adding a dissipative term to the average of the left an...
Optimization-based Approximate Dynamic Programming
Approximate Dynamic Programming Approximate Linear Programming,
font style='font-size:12px;'>
2014/12/18
Reinforcement learning algorithms hold promise in many complex domains, such as resource management and planning under uncertainty. Most reinforcement learning algorithms are iterative - they successi...
Filters and Ultrafilters as Approximate Solutions in the Attainability Problems with Constraints of Asymptotic Character
Control problems Ultrafilters Topology
font style='font-size:12px;'>
2013/1/29
Abstract problems about attainability in topological spaces are considered. Some nonsequential version of the Warga approximate solutions is investigated: we use filters and ultrafilters of measurable...
Approximate-Backbone Guided Fast Ant Algorithms to QAP——求解QAP问题的近似骨架导向快速蚁群算法∗
QAP 近似骨架 ABFANT QAPLIB
font style='font-size:12px;'>
2008/3/12
AbstractQuadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems and is known for its diverse applications. This paper presents a new fast ant heuristic for the Q...