Sciweavers

74 search results - page 12 / 15
» Problem Generators for Rectangular packing problems
Sort
View
AAAI
2000
13 years 8 months ago
Sampling Methods for Action Selection in Influence Diagrams
Sampling has become an important strategy for inference in belief networks. It can also be applied to the problem of selecting actions in influence diagrams. In this paper, we pre...
Luis E. Ortiz, Leslie Pack Kaelbling
MP
2010
116views more  MP 2010»
13 years 5 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
VLSI
2010
Springer
13 years 5 months ago
Fine-grained post placement voltage assignment considering level shifter overhead
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
Zohreh Karimi, Majid Sarrafzadeh
TCAD
2011
13 years 2 months ago
GRIP: Global Routing via Integer Programming
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
ICPR
2008
IEEE
14 years 1 months ago
Human detection by searching in 3d space using camera and scene knowledge
Many existing human detection systems are based on sub-window classification, namely detection is done by enumerating rectangular sub-images in the 2D image space. Detection rate...
Yuan Li, Bo Wu, Ram Nevatia