1132 search results - page 189 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
106
click to vote
LICS
1997
IEEE
15 years 5 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
134
click to vote
FLAIRS
2006
15 years 3 months ago
2006
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...
117
click to vote
SMA
2010
ACM
15 years 2 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
ALGORITHMICA
2010
15 years 2 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
119
click to vote
ENTCS
2008
15 years 2 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...