Sciweavers

400 search results - page 46 / 80
» Backtracking
Sort
View
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 8 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
DAM
2008
145views more  DAM 2008»
13 years 8 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug
DAM
2007
60views more  DAM 2007»
13 years 8 months ago
Restricting SBH ambiguity via restriction enzymes
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
Steven Skiena, Sagi Snir
ENTCS
2007
81views more  ENTCS 2007»
13 years 8 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
ENTCS
2007
91views more  ENTCS 2007»
13 years 8 months ago
Dynamic Reverse Code Generation for Backward Execution
The need for backward execution in debuggers has been raised a number of times. Backward execution helps a user naturally think backwards and, in turn, easily locate the cause of ...
Jooyong Lee