1538 search results - page 187 / 308 » Relative Randomness and Cardinality |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
ANOR
2007
14 years 10 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
ENTCS
2008
14 years 10 months ago
2008
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
EOR
2008
14 years 10 months ago
2008
In this paper we consider a single item, discrete time, lot sizing situation where demand is random and its parameters (e.g., mean and standard deviation) can change with time. Fo...