Sciweavers

438 search results - page 56 / 88
» New Search Heuristics for Max-CSP
Sort
View
GECCO
2006
Springer
212views Optimization» more  GECCO 2006»
15 years 1 months ago
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
In this paper, we introduce a new crossover operator for the permutation representation of a GA. This new operator-Non-Wrapping Order Crossover (NWOX)--is a variation of the well-...
Vincent A. Cicirello
IEAAIE
2001
Springer
15 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 1 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 7 months ago
Querying spatial patterns
Spatial data are common in many scientific and commercial domains such as geographical information systems and gene/protein expression profiles. Querying for distribution patterns...
Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Si...
CSC
2008
14 years 11 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger