1670 search results - page 88 / 334 » On Skolemization in constructive theories |
166
click to vote
CATS
2006
15 years 7 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
165
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
204
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
166
click to vote
IFM
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
177
click to vote
ESANN
2006
15 years 7 months ago
2006
This paper presents a new method for constructing ensembles of classifiers based on immune network theory, one of the most interesting paradigms within the field of artificial imm...