2194 search results - page 174 / 439 » Improving HLRTA*( k ) |
108
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
112
click to vote
ICIC
2005
Springer
15 years 7 months ago
2005
Springer
: In this paper, a new approach for leaf recognition using the result of segmentation of leaf’s skeleton based on the combination of wavelet transform (WT) and Gaussian interpola...
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
113
click to vote
GD
2003
Springer
15 years 6 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
108
click to vote
PCI
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Extensive research has been carried out in search for an efcient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit p...