Sciweavers

88 search results - page 17 / 18
» Faster constraint solving with subtypes
Sort
View
AIPS
2006
13 years 6 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
CP
2008
Springer
13 years 6 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan
SIAMJO
2010
83views more  SIAMJO 2010»
13 years 3 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl
ECCV
2006
Springer
14 years 7 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
ICCAD
2005
IEEE
118views Hardware» more  ICCAD 2005»
14 years 2 months ago
Thermal via planning for 3-D ICs
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....
Jason Cong, Yan Zhang