Sciweavers

1974 search results - page 79 / 395
» Conditional Purchase Orders
Sort
View
LOPSTR
2007
Springer
15 years 10 months ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
JC
2006
53views more  JC 2006»
15 years 4 months ago
The randomized information complexity of elliptic PDE
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Stefan Heinrich
CORR
2012
Springer
179views Education» more  CORR 2012»
13 years 12 months ago
Distributional convergence for the number of symbol comparisons used by QuickSort
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
James Allen Fill
TACAS
2007
Springer
144views Algorithms» more  TACAS 2007»
15 years 10 months ago
Detecting Races in Ensembles of Message Sequence Charts
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible dis...
Edith Elkind, Blaise Genest, Doron Peled
JCT
1998
99views more  JCT 1998»
15 years 3 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu