Sciweavers

6562 search results - page 115 / 1313
» Noetherianity and Combination Problems
Sort
View
151
Voted
IJCAI
1993
15 years 6 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
ICML
2000
IEEE
16 years 5 months ago
Solving the Multiple-Instance Problem: A Lazy Learning Approach
As opposed to traditional supervised learning, multiple-instance learning concerns the problem of classifying a bag of instances, given bags that are labeled by a teacher as being...
Jun Wang, Jean-Daniel Zucker
CEC
2007
IEEE
15 years 11 months ago
Solving multimodal problems via multiobjective techniques with Application to phase equilibrium detection
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
Mike Preuss, Günter Rudolph, Feelly Tumakaka
150
Voted
EPIA
2007
Springer
15 years 10 months ago
A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...
Nelishia Pillay, Wolfgang Banzhaf
EVOW
2007
Springer
15 years 10 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz