Sciweavers

4095 search results - page 253 / 819
» How to test a tree
Sort
View
DAM
2006
100views more  DAM 2006»
15 years 5 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
149
Voted
EOR
2002
84views more  EOR 2002»
15 years 5 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
ICANNGA
2007
Springer
129views Algorithms» more  ICANNGA 2007»
15 years 9 months ago
Multi-class Support Vector Machines Based on Arranged Decision Graphs and Particle Swarm Optimization for Model Selection
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
Javier Acevedo, Saturnino Maldonado-Bascón,...
CLIN
2000
15 years 7 months ago
Transforming a Chunker to a Parser
Ever since the landmark paper Ramshaw and Marcus (1995), machine learning systems have been used successfully for identifying base phrases (chunks), the bottom constituents of a p...
Erik F. Tjong Kim Sang
COLOGNETWENTE
2009
15 years 7 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...