1938 search results - page 127 / 388 » On Positive Relational Calculi |
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed i...
113
click to vote
AROBOTS
2006
15 years 25 days ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
92
Voted
ELECTRONICMARKETS
2007
15 years 21 days ago
2007
In this paper we explore which bundles of services are attractive to users. We look specifically in bundle composition with navigation services as core, and travel and entertainme...
100
Voted
CP
2010
Springer
14 years 11 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
JCT
2010
14 years 11 months ago
2010
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...