3353 search results - page 281 / 671 » Laver and set theory |
164
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
186
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We generalize AGM belief revision theory to the multi-agent case. To do so, we first generalize the semantics of the singleagent case, based on the notion of interpretation, to th...
151
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a logic-based bargaining solution based on Zhang and Zhang's framework. It is shown that if the demand sets of players are logically closed, the solution s...
161
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
165
click to vote
EPEW
2006
Springer
15 years 8 months ago
2006
Springer
We present a stochastic process algebra including immediate actions, deadlock and termination, and explicit stochastic delays, in the setting of weak choice between immediate actio...