Sciweavers

16504 search results - page 127 / 3301
» New Problems, New Solutions
Sort
View
AIPS
2010
15 years 8 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
ICCAD
2006
IEEE
112views Hardware» more  ICCAD 2006»
16 years 3 months ago
A new RLC buffer insertion algorithm
Most existing buffering algorithms neglect the impact of inductance on circuit performance, which causes large error in circuit analysis and optimization. Even for the approaches...
Zhanyuan Jiang, Shiyan Hu, Jiang Hu, Zhuo Li, Weip...
AICOM
2007
61views more  AICOM 2007»
15 years 6 months ago
Scheduling social tournaments locally
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...
Iván Dotú, Pascal Van Hentenryck
ICPR
2004
IEEE
16 years 7 months ago
A New Approach For The Registration of Images With Inconsistent Differences
In this paper, we focus on the Image Registration problem. Mathematically, this problem consists of minimizing an energy which is composed of a regularization term and a similarit...
Frédéric J. P. Richard
ICCAD
2006
IEEE
113views Hardware» more  ICCAD 2006»
16 years 3 months ago
A new statistical max operation for propagating skewness in statistical timing analysis
Statistical static timing analysis (SSTA) is emerging as a solution for predicting the timing characteristics of digital circuits under process variability. For computing the stat...
Kaviraj Chopra, Bo Zhai, David Blaauw, Dennis Sylv...