Sciweavers

4403 search results - page 191 / 881
» Galois Theory of Algorithms
Sort
View
ACL
1994
15 years 7 months ago
On Determining the Consistency of Partial Descriptions of Trees
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
Tom Cornell
ADCM
2000
71views more  ADCM 2000»
15 years 6 months ago
Construction of multivariate biorthogonal wavelets with arbitrary vanishing moments
We present a concrete method to build discrete biorthogonal systems such that the wavelet filters have any number of vanishing moments. Several algorithms are proposed to construct...
Di-Rong Chen, Bin Han 0003, Sherman D. Riemenschne...
FUIN
1998
122views more  FUIN 1998»
15 years 6 months ago
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behav...
Günter Rudolph
POPL
2010
ACM
16 years 3 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
IJCAI
1993
15 years 7 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi