Sciweavers

1523 search results - page 150 / 305
» Partially ordered secretaries
Sort
View
AGP
1994
IEEE
15 years 9 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
CHI
2006
ACM
15 years 9 months ago
Representation of interwoven surfaces in 2 1/2 D drawing
The state-of-the-art in computer drawing programs is based on a number of concepts that are over two decades old. One such concept is the use of layers for ordering the surfaces i...
Keith Wiley, Lance R. Williams
FMICS
2006
Springer
15 years 9 months ago
Test Coverage for Loose Timing Annotations
Abstract. The design flow of systems-on-a-chip (SoCs) identifies several abstraction levels higher than the Register-Transfer-Level that constitutes the input of the synthesis tool...
Claude Helmstetter, Florence Maraninchi, Laurent M...
ECIR
2008
Springer
15 years 6 months ago
Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...
Frank McSherry, Marc Najork
TCS
2008
15 years 5 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...