Sciweavers

1813 search results - page 12 / 363
» Instance Pruning Techniques
Sort
View
INFORMS
2010
138views more  INFORMS 2010»
14 years 8 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
ANOR
2008
93views more  ANOR 2008»
14 years 9 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
15 years 1 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
ICASSP
2009
IEEE
15 years 4 months ago
Combining mixture weight pruning and quantization for small-footprint speech recognition
Semi-continuous acoustic models, where the output distributions for all Hidden Markov Model states share a common codebook of Gaussian density functions, are a well-known and prov...
David Huggins-Daines, Alexander I. Rudnicky
GEM
2007
14 years 11 months ago
Searching for Snake-In-The-Box Codes With Evolved Pruning Models
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...