3600 search results - page 77 / 720 » The settling-time reducibility ordering |
137
Voted
ISCIS
2004
Springer
15 years 11 months ago
2004
Springer
Partial order methods, such as the stubborn set method and the priority method, reduce verification effort by exploiting irrelevant orders of events. We show how the stubborn set...
148
click to vote
CTRSA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We report on the experiments we performed in order to assess the security of SHA-1 against the attack by Chabaud and Joux [5]. We present some ideas for optimizations of ...
137
click to vote
EDUTAINMENT
2008
Springer
15 years 7 months ago
2008
Springer
In order to reduce both the psychological and physical stress in air travel, sensors are integrated in airplane seats to detect the gestures as input for in-flight entertainment sy...
123
click to vote
IJCAI
1989
15 years 7 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
126
click to vote
AIPS
2003
15 years 7 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...