Sciweavers

4451 search results - page 411 / 891
» On Random Ordering Constraints
Sort
View
IJCAI
2007
15 years 8 months ago
r-grams: Relational Grams
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoot...
Niels Landwehr, Luc De Raedt
BDA
2006
15 years 8 months ago
Capturing well typed references in DTDs
Surprisingly enough, there has been few investigations for typing references of semistructured data and XML documents. This paper build on a previous proposal [7] introducing simp...
Nicole Bidoit, Dario Colazzo
AUTOMATICA
2007
161views more  AUTOMATICA 2007»
15 years 7 months ago
Principles of 2-sliding mode design
Second order sliding modes are used to keep exactly a constraint of the second relative degree or just to avoid chattering, i.e. in the cases when the standard (first order) slidi...
Arie Levant
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 7 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada