1096 search results - page 30 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
105
click to vote
SSD
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
133
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
CP
2007
Springer
15 years 1 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...