539 search results - page 93 / 108 » An Improved Upper Bound for SAT |
PADS
1999
ACM
14 years 1 months ago
1999
ACM
We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, we present ParaPART, a parallel version of a mesh partitioning tool, called PART, for distributed systems. PART takes into consideration the heterogeneities in proce...
COLT
1999
Springer
14 years 1 months ago
1999
Springer
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
COCO
1998
Springer
14 years 1 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
COMPGEOM
1996
ACM
14 years 1 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...