2681 search results - page 200 / 537 » Problem F |
86
Voted
JUCS
2002
15 years 2 months ago
2002
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
109
click to vote
SIAMSC
2010
15 years 24 days ago
2010
Abstract. Several innovative random-sampling and random-mixing techniques for solving problems in linear algebra have been proposed in the last decade, but they have not yet made a...
115
Voted
TOPLAS
2010
15 years 23 days ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
116
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
143
click to vote
SIAMCO
2011
14 years 9 months ago
2011
We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continu...