Sciweavers

1200 search results - page 41 / 240
» Marked Ancestor Problems
Sort
View
IJRR
2008
92views more  IJRR 2008»
13 years 10 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
SIGGRAPH
1996
ACM
14 years 2 months ago
Adding Force Feedback to Graphics Systems: Issues and Solutions
Integrating force feedback with a complete real-time virtual environment system presents problems which are more difficult than those encountered in building simpler forcefeedback...
William R. Mark, Scott C. Randolph, Mark Finch, Ja...
COMPSAC
2007
IEEE
14 years 1 months ago
Piping Classification to Metamorphic Testing: An Empirical Study towards Better Effectiveness for the Identification of Failures
Mesh simplification is a mainstream technique to render graphics responsively in modern graphical software. However, the graphical nature of the output poses a test oracle problem...
W. K. Chan, Jeffrey C. F. Ho, T. H. Tse
ECSCW
2003
13 years 11 months ago
Dependable Red Hot Action
We present a brief observational, ‘ethnographic’, study of the Roughing Mill in a steel plant and use material from recorded activities to provide ‘illustrative vignettes’ ...
Karen Clarke, John A. Hughes, David Martin, Mark R...
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 10 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari