Sciweavers

1523 search results - page 135 / 305
» Partially ordered secretaries
Sort
View
72
Voted
RTA
2005
Springer
15 years 6 months ago
Leanest Quasi-orderings
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
Nachum Dershowitz, E. Castedo Ellerman
93
Voted
ECAI
2004
Springer
15 years 6 months ago
Qualitative Reasoning Feeding Back into Quantitative Model-Based Tracking
Tracking vehicles in image sequences of innercity road traffic scenes still constitutes a challenging task. Even if a-priori knowledge about the 3D shape of vehicles, of backgroun...
Christian Köhler, Artur Ottlik, Hans-Hellmut ...
BIRTHDAY
2000
Springer
15 years 5 months ago
Bistructures, bidomains, and linear logic
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
Pierre-Louis Curien, Gordon D. Plotkin, Glynn Wins...
123
Voted
CAISE
2000
Springer
15 years 5 months ago
Temporally Faithful Execution of Business Transactions
Serializability is a prominent correctness criterion for an interleaved execution of concurrent transactions. Serializability guarantees that the interleaved execution of concurre...
Werner Obermair, Michael Schrefl
109
Voted
IMPERIAL
1993
15 years 4 months ago
Prioritising Preference Relations
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
Mark Ryan