Sciweavers

223 search results - page 28 / 45
» Pattern Search Methods for Linearly Constrained Minimization
Sort
View
CP
2005
Springer
15 years 5 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
AI
2006
Springer
14 years 12 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
PETRA
2009
ACM
15 years 6 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
IPPS
1999
IEEE
15 years 4 months ago
A Parallel Genetic Algorithm for Task Mapping on Parallel Machines
In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilizat...
S. Mounir Alaoui, Ophir Frieder, Tarek A. El-Ghaza...
ICML
2006
IEEE
16 years 18 days ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth