3758 search results - page 278 / 752 » A Complete Subsumption Algorithm |
137
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
115
click to vote
ENGL
2008
15 years 6 months ago
2008
-- The considered converter-fed permanent magnet motor could alternatively be operated in two basically different states - the vector control mode or alternatively the brushless dc...
139
click to vote
COR
2006
15 years 6 months ago
2006
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
147
click to vote
ENTCS
2006
15 years 6 months ago
2006
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...