Sciweavers

957 search results - page 7 / 192
» Addition Chain Heuristics
Sort
View
CLA
2004
13 years 11 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig
WSC
1997
13 years 11 months ago
Panel on Transportation and Logistics Modeling
Transportation and logistics are fertile areas for modeling. Simulation has traditionally been used in warehousing and inside the distribution center or processing hub in the truc...
John S. Carson II, Mani S. Manivannan, Mark K. Bra...
ACISICIS
2007
IEEE
14 years 4 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
CAEPIA
2007
Springer
14 years 4 months ago
Heuristics for Planning with Action Costs
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
Emil Keyder, Hector Geffner
AUSAI
2010
Springer
13 years 9 months ago
Heuristic Planning with SAT: Beyond Uninformed Depth-First Search
Abstract. Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dom...
Jussi Rintanen