Sciweavers

34974 search results - page 222 / 6995
» The particle computer system
Sort
View
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 5 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
EVOW
2009
Springer
16 years 2 months ago
Humorized Computational Intelligence towards User-Adapted Systems with a Sense of Humor
This paper investigates the role of humor in non-task oriented (topic restriction free) human-computer dialogue, as well as the correlation between humor and emotions elicited by i...
Pawel Dybala, Michal Ptaszynski, Rafal Rzepka, Ken...
ICDCS
2008
IEEE
16 years 1 months ago
stdchk: A Checkpoint Storage System for Desktop Grid Computing
— Checkpointing is an indispensable technique to provide fault tolerance for long-running high-throughput applications like those running on desktop grids. This paper argues that...
Samer Al-Kiswany, Matei Ripeanu, Sudharshan S. Vaz...
ICARIS
2003
Springer
16 years 13 days ago
Artificial Immune Systems and the Grand Challenge for Non-classical Computation
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the ident...
Susan Stepney, John A. Clark, Colin G. Johnson, De...
RTA
2010
Springer
15 years 11 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram