15 search results - page 3 / 3 » ams 1997 |
DIMACS
1996
13 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
COMBINATORICS
1998
13 years 9 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
SYNTHESE
2008
13 years 9 months ago
2008
Quine (1960, ch.2) claims that there are a variety of equally good schemes for translating or interpreting ordinary talk. `Rabbit' might be taken to divide its reference over...