Sciweavers

1383 search results - page 254 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
STACS
1999
Springer
15 years 4 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICDT
2010
ACM
195views Database» more  ICDT 2010»
15 years 3 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
RTSS
1992
IEEE
15 years 3 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
106
Voted
ECAI
2008
Springer
15 years 1 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
ICAI
2004
15 years 1 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger