2584 search results - page 26 / 517 » On the Forward Checking Algorithm |
IPL
2007
13 years 7 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
ECSQARU
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The Transferable Belief Model (TBM) relies on belief functions and enables one to represent and combine a variety of knowledge from certain up to ignorance as well as con...
RSS
2007
13 years 9 months ago
2007
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Relays represent a promising approach to extend the cell coverage, combat the strong shadowing effects as well as guarantee the QoS in dense networks. Among the numerous existing ...
MICRO
2000
IEEE
14 years 6 days ago
2000
IEEE
A slipstream processor reduces the length of a running program by dynamically skipping computation non-essential for correct forward progress. The shortened program runs faster as...