1523 search results - page 93 / 305 » Partially ordered secretaries |
101
Voted
SLP
1993
15 years 2 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
104
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
CAV
1998
Springer
15 years 5 months ago
1998
Springer
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
146
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
92
Voted
BSL
2000
15 years 16 days ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...