99 search results - page 1 / 20 » Scott's problem for Proper Scott sets |
JSYML
2008
13 years 7 months ago
2008
Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and
COMPGEOM
2004
ACM
14 years 26 days ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
BSL
2008
13 years 7 months ago
2008
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
BMVC
1998
13 years 8 months ago
1998
A novel method is described for obtaining superior classification performance over a variable range of classification costs. By analysis of a set of existing classifiers using a r...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...