Sciweavers

673 search results - page 51 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 27 days ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
ACML
2009
Springer
13 years 11 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
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 3 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
COR
2006
108views more  COR 2006»
13 years 7 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
EH
1999
IEEE
351views Hardware» more  EH 1999»
13 years 12 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...