1814 search results - page 72 / 363 » Improved Results on Geometric Hitting Set Problems |
IJCAI
1993
13 years 11 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
ICCAD
2005
IEEE
14 years 7 months ago
2005
IEEE
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of applications. While steady progress has been made in t...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
ACSC
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
PPSN
1998
Springer
14 years 2 months ago
1998
Springer
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...