Sciweavers

10568 search results - page 318 / 2114
» Computer Intelligence and Formalization
Sort
View
ACSAC
2006
IEEE
15 years 10 months ago
Engineering Sufficiently Secure Computing
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
Brian Witten
ATAL
2010
Springer
15 years 5 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
UAIS
2002
100views more  UAIS 2002»
15 years 3 months ago
Toward overcoming culture, skill and situation hurdles in Human-Computer Interaction
Abstract. This paper proposes a new effective strategy for designing and implementing interactive systems overcoming culture, skill and situation hurdles in HumanComputer Interacti...
Paola Carrara, Daniela Fogli, Giuseppe Fresta, Pie...
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 2 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
15 years 10 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida