Sciweavers

10996 search results - page 1979 / 2200
» Future Directions in Computing
Sort
View
PRDC
2009
IEEE
14 years 3 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...
ACG
2009
Springer
14 years 3 months ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 3 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
SPIN
2009
Springer
14 years 3 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
IROS
2008
IEEE
148views Robotics» more  IROS 2008»
14 years 3 months ago
Identifying a moving object with an accelerometer in a camera view
— This paper proposes a method for identifying an object which contains an accelerometer out of many moving objects in the view of a stationary camera using motion data obtained ...
Osamu Shigeta, Shingo Kagami, Koichi Hashimoto
« Prev « First page 1979 / 2200 Last » Next »