3353 search results - page 196 / 671 » Laver and set theory |
170
click to vote
GRC
2005
IEEE
16 years 3 days ago
2005
IEEE
— Decision rules generated from reducts can fully describe a data set. We introduce a new method of evaluating rules by taking advantage of rough sets theory. We consider rules g...
149
click to vote
ARGMAS
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we propose a flexible dialogue mechanism through which a set of agents can establish a coherent set of public beliefs. Flexibility and coherence are achieved by dec...
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
183
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We develop theory and algorithms to incorporate image manifold constraints in a level set segmentation algorithm. This provides a framework to simultaneously segment every image o...
212
click to vote
DALT
2005
Springer
16 years 1 days ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...