537 search results - page 61 / 108 » A new upper bound for 3-SAT |
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates ...
100
click to vote
TOCL
2008
14 years 9 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
MOR
2007
14 years 9 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
ATMOS
2010
14 years 9 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...