Sciweavers

3221 search results - page 560 / 645
» Termination of Linear Programs
Sort
View
JSAT
2006
88views more  JSAT 2006»
15 years 6 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
OL
2008
79views more  OL 2008»
15 years 6 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
PR
2006
102views more  PR 2006»
15 years 6 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
STTT
2008
90views more  STTT 2008»
15 years 6 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier
IJRR
2007
181views more  IJRR 2007»
15 years 6 months ago
Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
Thomas M. Howard, Alonzo Kelly