2669 search results - page 76 / 534 » Complex Spatial Relationships |
ISSRE
2005
IEEE
15 years 3 months ago
2005
IEEE
Code prioritization for testing promises to achieve the maximum testing coverage with the least cost. This paper presents an innovative method to provide hints on which part of co...
105
click to vote
IJCGA
2010
14 years 8 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
ASIACRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
COCO
1995
Springer
15 years 1 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
GC
2002
Springer
14 years 9 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...