Sciweavers

16091 search results - page 431 / 3219
» Solving
Sort
View
ACML
2009
Springer
15 years 10 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
CAV
2007
Springer
212views Hardware» more  CAV 2007»
15 years 10 months ago
A Tutorial on Satisfiability Modulo Theories
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Leonardo Mendonça de Moura, Bruno Dutertre,...
LION
2010
Springer
230views Optimization» more  LION 2010»
15 years 10 months ago
A Study of the Parallelization of the Multi-Objective Metaheuristic MOEA/D
MOEA/D is a multi-objective metaheuristic which has shown a remarkable performance when solving hard optimization problems. In this paper, we propose a thread-based parallel versio...
Antonio J. Nebro, Juan J. Durillo
ICLP
2010
Springer
15 years 10 months ago
Towards a General Argumentation System based on Answer-Set Programming
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
Sarah Alice Gaggl
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 10 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi