2766 search results - page 323 / 554 » Algorithms for trigonometric polynomials |
160
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
119
click to vote
FUN
2007
Springer
15 years 11 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
113
click to vote
HM
2007
Springer
15 years 11 months ago
2007
Springer
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
120
click to vote
IJCNN
2006
IEEE
15 years 11 months ago
2006
IEEE
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
132
Voted
ACMSE
2006
ACM
15 years 11 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...