Sciweavers

3128 search results - page 128 / 626
» Finite element method
Sort
View
ORDER
2010
101views more  ORDER 2010»
15 years 1 months ago
Definability in Substructure Orderings, II: Finite Ordered Sets
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We ...
Jaroslav Jezek, Ralph McKenzie
160
Voted
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
14 years 3 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
APAL
2010
97views more  APAL 2010»
15 years 1 months ago
The free n-generated BL-algebra
The theory of Schauder hats is a beautiful and powerful tool for investigating, under several respects, the algebraic semantics of Lukasiewicz infinite-valued logic [CDM99], [MMM07...
Stefano Aguzzoli, Simone Bova
117
Voted
ISCIS
2005
Springer
15 years 9 months ago
Generalizing Redundancy Elimination in Checking Sequences
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...