Sciweavers

5499 search results - page 241 / 1100
» Generalized Rewrite Theories
Sort
View
CP
2008
Springer
15 years 9 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
LANMR
2007
15 years 8 months ago
Teaching natural deduction to improve text argumentation analysis in engineering students
Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...
Rogelio Dávila, Sara C. Hernández, J...
161
Voted
AUTOMATICA
2010
72views more  AUTOMATICA 2010»
15 years 7 months ago
Span-reachability and observability of bilinear hybrid systems
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
Mihály Petreczky, Jan H. van Schuppen
FSS
2007
82views more  FSS 2007»
15 years 7 months ago
An empirical test of some measurement-theoretic axioms for fuzzy sets
In the previous years some authors have been elaborating on the measurementtheoretic foundations of fuzzy set theory. A well-known problem in this approach is the difficult applic...
C. Desimpelaere, Thierry Marchant
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 7 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira