Sciweavers

4940 search results - page 664 / 988
» On the Complexity of Universal Programs
Sort
View
CPAIOR
2009
Springer
16 years 1 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
FM
2009
Springer
110views Formal Methods» more  FM 2009»
16 years 1 months ago
Reduced Execution Semantics of MPI: From Theory to Practice
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
Sarvani S. Vakkalanka, Anh Vo, Ganesh Gopalakrishn...
MM
2009
ACM
217views Multimedia» more  MM 2009»
16 years 1 months ago
Streaming HD H.264 encoder on programmable processors
Programmable processors have great advantage over dedicated ASIC design under intense time-to-market pressure. However, realtime encoding of high-definition (HD) H.264 video (up t...
Nan Wu, Mei Wen, Wei Wu, Ju Ren, Huayou Su, Changq...
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
DSN
2008
IEEE
16 years 1 months ago
Towards an understanding of anti-virtualization and anti-debugging behavior in modern malware
Many threats that plague today’s networks (e.g., phishing, botnets, denial of service attacks) are enabled by a complex ecosystem of attack programs commonly called malware. To ...
Xu Chen, Jonathon Andersen, Zhuoqing Morley Mao, M...