92 search results - page 10 / 19 » New Heuristics for Timeline-Based Planning |
ESWA
2007
14 years 9 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
IJCAI
2001
14 years 11 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
ATMOS
2009
14 years 10 months ago
2009
Abstract. We consider a fundamental problem, called QoS-aware Multicommodity Flow, for assessing robustness in transportation planning. It constitutes a natural generalization of t...
103
click to vote
EDBT
2012
ACM
13 years 9 hour ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
74
Voted
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...