Sciweavers

110 search results - page 21 / 22
» Exact solutions to a class of stochastic generalized assignm...
Sort
View
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
JMLR
2008
150views more  JMLR 2008»
13 years 7 months ago
Discriminative Learning of Max-Sum Classifiers
The max-sum classifier predicts n-tuple of labels from n-tuple of observable variables by maximizing a sum of quality functions defined over neighbouring pairs of labels and obser...
Vojtech Franc, Bogdan Savchynskyy
FOAL
2009
ACM
14 years 2 months ago
Enhancing base-code protection in aspect-oriented programs
Aspect-oriented programming (AOP) promises to localize concerns that inherently crosscut the primary structural decomposition of a software system. Localization of concerns is cri...
Mohamed ElBendary, John Boyland
ENDM
2010
167views more  ENDM 2010»
13 years 5 months ago
Column Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper