Sciweavers

977 search results - page 33 / 196
» Soft Constraints for Security
Sort
View
KR
2004
Springer
15 years 3 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
CSCLP
2006
Springer
15 years 1 months ago
Bipolar Preference Problems: Framework, Properties and Solving Techniques
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemin...
Stefano Bistarelli, Maria Silvia Pini, Francesca R...
TCAD
2008
172views more  TCAD 2008»
14 years 9 months ago
General Methodology for Soft-Error-Aware Power Optimization Using Gate Sizing
Power consumption has emerged as the premier and most constraining aspect in modern microprocessor and application-specific designs. Gate sizing has been shown to be one of the mos...
Foad Dabiri, Ani Nahapetian, Tammara Massey, Miodr...
EVOW
2005
Springer
15 years 3 months ago
Application of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
Rhydian Lewis, Ben Paechter
AISB
1995
Springer
15 years 1 months ago
The Ant Colony Metaphor for Searching Continuous Design Spaces
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
George Bilchev, Ian C. Parmee