Sciweavers

5269 search results - page 45 / 1054
» order 2007
Sort
View
AMC
2007
89views more  AMC 2007»
14 years 11 months ago
A numerical iterative scheme for computing finite order rank-one convex envelopes
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...
Xin Wang, Zhiping Li
CIE
2007
Springer
15 years 6 months ago
Binary Trees and (Maximal) Order Types
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
Gyesik Lee
ICISC
1998
87views Cryptology» more  ICISC 1998»
15 years 1 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...
IJCAI
1989
15 years 1 months ago
Ordering Problem Subgoals
Most past research work on problem subgoal ordering are of a heuristic nature and very little attempt has been made to reveal the inherent relationship between subgoal ordering co...
Jie Cheng, Keki B. Irani
TPHOL
2007
IEEE
15 years 6 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow