Sciweavers

1483 search results - page 42 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
ICCAD
2003
IEEE
114views Hardware» more  ICCAD 2003»
15 years 8 months ago
A Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
Peter G. Sassone, Sung Kyu Lim
IBPRIA
2007
Springer
15 years 6 months ago
Variational Deconvolution of Multi-channel Images with Inequality Constraints
Abstract. A constrained variational deconvolution approach for multichannel images is presented. Constraints are enforced through a reparametrisation which allows a differential g...
Martin Welk, James G. Nagy
AAAI
1994
15 years 1 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
ICIP
1999
IEEE
15 years 4 months ago
Compensation of Unidirectional Geometric Distortion in EPI Using Spline Warping
Due to magnetic field inhomogeneities, EPI images are geometrically distorted, predominantly along the phase-encoding direction. Currently, the distortion is either ignored or com...
Jan Kybic, Philippe Thévenaz, Michael Unser
AAAI
2007
15 years 2 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre