Sciweavers

4114 search results - page 89 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 4 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
126
Voted
ICIP
2009
IEEE
15 years 2 months ago
A low-complexity reduced-reference print identification algorithm
In a print production system, the ability to match a printed document with its original electronic form enables services that improve robustness of the production process, such as...
Matthew Gaubatz, Robert Ulichney, David M. Rouse
167
Voted
PPDP
2010
Springer
15 years 2 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
ISNN
2004
Springer
15 years 10 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
IJIT
2004
15 years 6 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...