4488 search results - page 99 / 898 » Focusing Search by Using Problem Solving Experience |
106
click to vote
SAT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
131
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
142
click to vote
KR
2004
Springer
15 years 8 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
122
click to vote
IADIS
2004
15 years 4 months ago
2004
Argument visualisation refers to graphical or other non-verbal means of making reasoning chains and conclusions explicit. Constructing argument diagrams is one way to visualise ar...
129
click to vote
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...