7380 search results - page 375 / 1476 » time 2008 |
157
click to vote
IPL
2008
15 years 6 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
148
click to vote
IPL
2008
15 years 6 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
171
click to vote
IPL
2008
15 years 6 months ago
2008
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
158
click to vote
ISR
2008
15 years 6 months ago
2008
s displays harmed interrupters' task performance, while abstract displays did not. We conclude that y with an abstract representation of a collaborator's workload is opti...
177
click to vote
JACIII
2008
15 years 6 months ago
2008
The development of on line model-based fault detection systems in machinery improves the operational reliability of industrial systems and reduces the operational and maintenance ...