1679 search results - page 131 / 336 » Strong order equivalence |
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
RTA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
ISM
2005
IEEE
14 years 3 months ago
2005
IEEE
— For efficient video data management, ‘video data mining’ is required to discover ‘semantic patterns’ which are not only previously unknown and interesting, but also as...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...