Sciweavers

66 search results - page 6 / 14
» Reaching a Goal with Directional Uncertainty
Sort
View
COR
2011
15 years 29 days ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
SAC
2010
ACM
16 years 24 days ago
A deidealisation semantics for KAOS
KAOS is a goal directed requirements engineering framework based on the decomposition and refinement of goals. Decomposition and refinement continue until a point is reached at ...
Richard Banach
AIME
2001
Springer
15 years 10 months ago
NasoNet, Joining Bayesian Networks and Time to Model Nasopharyngeal Cancer Spread
Abstract. Cancer spread is a non-deterministic dynamic process. As a consequence, the design of an assistant system for the diagnosis and prognosis of the extent of a cancer should...
Severino F. Galán, Francisco Aguado, Franci...
AR
2006
116views more  AR 2006»
15 years 6 months ago
Slip-compensated path following for planetary exploration rovers
A system that enables continuous slip compensation for a Mars rover has been designed, implemented, and field-tested. This system is composed of several components that allow the ...
Daniel M. Helmick, Stergios I. Roumeliotis, Yang C...
TROB
2010
159views more  TROB 2010»
15 years 19 days ago
Task-Specific Generalization of Discrete and Periodic Dynamic Movement Primitives
Abstract--Acquisition of new sensorimotor knowledge by imitation is a promising paradigm for robot learning. To be effective, action learning should not be limited to direct replic...
Ales Ude, Andrej Gams, Tamim Asfour, Jun Morimoto