2584 search results - page 193 / 517 » On the Forward Checking Algorithm |
112
click to vote
CSC
2008
15 years 3 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
122
click to vote
ICIP
2006
IEEE
16 years 3 months ago
2006
IEEE
We develop a set of new motion estimation (ME) algorithms based mainly on Unsymmetric-Cross Multi-Hexagon-Grid Search (UMH). The original algorithms are improved by applying the S...
103
click to vote
FLAIRS
2003
15 years 3 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
110
click to vote
DAC
2003
ACM
16 years 3 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
99
Voted
ENTCS
2007
15 years 2 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...