Sciweavers

1165 search results - page 136 / 233
» Effective linear programming based placement methods
Sort
View
MP
2010
92views more  MP 2010»
14 years 9 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
AI
2002
Springer
15 years 2 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
GREC
2003
Springer
15 years 8 months ago
Resolving Ambiguities in Toponym Recognition in Cartographic Maps
To date many methods and programs for automatic text recognition exist. However there are no effective text recognition systems for graphic documents. Graphic documents usually con...
Alexander F. Gelbukh, Serguei Levachkine, Sang-Yon...
MICCAI
2009
Springer
16 years 4 months ago
Steerable Features for Statistical 3D Dendrite Detection
Most state-of-the-art algorithms for filament detection in 3?D image-stacks rely on computing the Hessian matrix around individual pixels and labeling these pixels according to its...
François Aguet, François Fleuret, Ge...
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
15 years 7 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...