Sciweavers

573 search results - page 59 / 115
» Sentence generation as a planning problem
Sort
View
ESWA
2007
100views more  ESWA 2007»
13 years 8 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
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...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
IJRR
2007
104views more  IJRR 2007»
13 years 8 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
PRICAI
2004
Springer
14 years 2 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
14 years 3 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
WSC
2008
13 years 11 months ago
Concurrent simulation and optimization models for mining planning
One of the most important challenges for mining engineers is to correctly analyze and generate short-term planning schedules, or simply month mining plan. The objective is to demo...
Marcelo Moretti Fioroni, Luiz Augusto Gago Franzes...