Sciweavers

391 search results - page 67 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
CSCLP
2004
Springer
14 years 3 days ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
HEURISTICS
2010
13 years 4 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...
SAT
2005
Springer
129views Hardware» more  SAT 2005»
14 years 6 days ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
ICIP
2007
IEEE
14 years 8 months ago
Domain-Partitioning Rankboost for Face Recognition
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
Bangpeng Yao, Haizhou Ai, Yoshihisa Ijiri, Shihong...
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
13 years 11 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar