Sciweavers

4218 search results - page 691 / 844
» Complete sets of cooperations
Sort
View
JACM
2010
116views more  JACM 2010»
13 years 7 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
JAPLL
2010
98views more  JAPLL 2010»
13 years 7 months ago
On database query languages for K-relations
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
Floris Geerts, Antonella Poggi
JMLR
2010
129views more  JMLR 2010»
13 years 7 months ago
On Finding Predictors for Arbitrary Families of Processes
The problem is sequence prediction in the following setting. A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic ...
Daniil Ryabko
KBSE
2010
IEEE
13 years 7 months ago
Realizing architecture frameworks through megamodelling techniques
Most practising software architects operate within an architecture framework which is a coordinated set of viewpoints, models and notations prescribed for them. Whereas architectu...
Rich Hilliard, Ivano Malavolta, Henry Muccini, Pat...
MFCS
2010
Springer
13 years 7 months ago
Asynchronous Omega-Regular Games with Partial Information
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
Bernd Puchala