Sciweavers

513 search results - page 43 / 103
» Finitely Based, Finite Sets of Words
Sort
View
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
14 years 11 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo
ISCIS
2009
Springer
15 years 6 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
FOIKS
2008
Springer
15 years 1 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link
JACIII
2008
112views more  JACIII 2008»
14 years 11 months ago
Favoring Consensus and Penalizing Disagreement in Group Decision Making
Abstract. In this paper we introduce a multi-stage decision making procedure where decision makers' opinions are weighted by their contribution to the agreement after they sor...
José Luis García-Lapresta
MST
2008
124views more  MST 2008»
14 years 11 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...