1486 search results - page 169 / 298 » Algorithms for two-box covering |
113
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
130
click to vote
SAC
1997
ACM
15 years 8 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
149
click to vote
WADS
1997
Springer
15 years 8 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
105
click to vote
HAPTICS
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper presents a measure for assessing the perceived hardness of a haptic surface based on associated physical variables. This metric, named extended rate-hardness (ERH), is e...
146
click to vote
ANTS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...