Sciweavers

3719 search results - page 32 / 744
» order 2010
Sort
View
MLQ
2010
124views more  MLQ 2010»
13 years 8 months ago
Countably categorical coloured linear orders
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
Feresiano Mwesigye, John K. Truss
ICPR
2010
IEEE
14 years 2 months ago
Gaussian Process Learning from Order Relationships Using Expectation Propagation
A method for Gaussian process learning of a scalar function from a set of pair-wise order relationships is presented. Expectation propagation is used to obtain an approximation to...
Ruixuan Wang, Stephen James Mckenna
STTT
2010
120views more  STTT 2010»
13 years 4 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
ENTCS
2007
144views more  ENTCS 2007»
13 years 9 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
ORDER
2010
110views more  ORDER 2010»
13 years 8 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry