729 search results - page 62 / 146 » Solving subgraph isomorphism problems with constraint progra... |
137
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
141
click to vote
SIAMJO
2010
15 years 25 days ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
171
click to vote
ECWEB
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. e-Procurement is an Internet-based business process for obtaining materials and services and managing their inflow into the organization. In this paper we develop multia...
204
click to vote
COCOS
2003
Springer
15 years 11 months ago
2003
Springer
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...
189
click to vote
ACML
2009
Springer
15 years 10 months ago
2009
Springer
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...