Sciweavers

8437 search results - page 685 / 1688
» Preferences over Sets
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 7 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 7 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic
186
Voted
EJC
2010
15 years 7 months ago
Inversion of some series of free quasi-symmetric functions
We give a combinatorial formula for the inverses of the alternating sums of free quasi-symmetric functions of the form F(I) where I runs over compositions with parts in a prescribe...
Florent Hivert, Jean-Christophe Novelli, Jean-Yves...
EJC
2010
15 years 7 months ago
The flipping puzzle on a graph
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Hau-wen Huang, Chih-wen Weng
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 7 months ago
The Power and Perils of MDL
Practical use of MDL is full of pitfalls in which the practitioners tend to fall head over heels. We analyse the power and the perils in the use of MDL. Generally, the classical a...
Pieter W. Adriaans, Paul M. B. Vitányi