This paper describes an e-Government AI project that provides a range of intelligent AI services to support automated assessment of various types of applications submitted to an i...
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
Aggressive CMOS scaling will make future chip multiprocessors (CMPs) increasingly susceptible to transient faults, hard errors, manufacturing defects, and process variations. Exis...
In this paper we determine the number of isomorphism classes of Picard curves, i.e., superelliptic curves y3 = f(x) of genus three, over finite fields of characteristic different f...
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...