Sciweavers

2899 search results - page 27 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
IEAAIE
2004
Springer
15 years 6 months ago
A New Edge-Grouping Algorithm for Multiple Complex Objects Localization
We present a new algorithm that provides an efficient localization method of elliptic industrial objects. Our proposed feature extraction inherits edge grouping approaches. But ins...
Yuichi Motai
SSWMC
2004
15 years 2 months ago
On the complexity and hardness of the steganography embedding problem
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
ISSS
2000
IEEE
191views Hardware» more  ISSS 2000»
15 years 4 months ago
Conditional Scheduling for Embedded Systems using Genetic List Scheduling
One important part of a HW/SW codesign system is the scheduler which is needed in order to determine if a given HW/SW partitioning is suitable for a given application. In this pap...
Martin Grajcar
IJCAI
2001
15 years 2 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
WDAG
2007
Springer
97views Algorithms» more  WDAG 2007»
15 years 7 months ago
On the Message Complexity of Indulgent Consensus
Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily lo...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...