17049 search results - page 235 / 3410 » cans 2007 |
129
click to vote
ANOR
2002
15 years 6 months ago
2002
This article is devoted to adverse selection problems in which individual private information is a whole utility function and cannot be reduced to some finite-dimensional parameter...
199
click to vote
APIN
2002
15 years 6 months ago
2002
We develop the scheme of indefinite constraint databases using first-order logic as our representation language. When this scheme is instantiated with temporal constraints, the res...
157
click to vote
AROBOTS
2004
15 years 6 months ago
2004
This paper addresses the localization and mapping problem for a robot moving through a (possibly) unknown environment where indistinguishable landmarks can be detected. A set theo...
153
click to vote
ARSCOM
2004
15 years 6 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
188
click to vote
ASE
2004
15 years 6 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...