Sciweavers

1146 search results - page 27 / 230
» Finite cupping sets
Sort
View
WCE
2007
13 years 8 months ago
Comparison of Optimum and Square Blanks Using the Sensitivity Approach
—This paper studies the modified sensitivity analysis applied into an elastic-plastic finite element analysis of a 3D blank design in sheet metal forming. Originally the sensitiv...
F. R. Biglari, A. Agahi, O. Nikfarjam, B. M. Daria...
BIRTHDAY
2004
Springer
14 years 1 months ago
A Proof of Regularity for Finite Splicing
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
Vincenzo Manca
AAAI
2010
13 years 9 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
CP
2004
Springer
14 years 1 months ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet