80 search results - page 11 / 16 » On the application of least-commitment and heuristic search ... |
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we describe EventNet, a toolkit for inferring temporal relations between Commonsense events. It comprises 10,000 nodes and 30,000 temporal links mined from the Openm...
AIPS
2009
13 years 8 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
CONSTRAINTS
1998
13 years 7 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
AIPS
2009
13 years 8 months ago
2009
Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploi...