1041 search results - page 136 / 209 » Randomizing Reductions of Search Problems |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
AI
1998
Springer
14 years 2 days ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...