Sciweavers

6740 search results - page 564 / 1348
» Using Classification as a Programming Language
Sort
View
ICALP
1995
Springer
15 years 8 months ago
Weakly Useful Sequences
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
152
Voted
PLDI
2011
ACM
14 years 7 months ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
168
Voted
IEICET
2007
110views more  IEICET 2007»
15 years 4 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
UM
2009
Springer
15 years 11 months ago
Predicting Customer Models Using Behavior-Based Features in Shops
Abstract. Recent sensor technologies have enabled the capture of users’ behavior data. Given the large amount of data currently available from sensor-equipped environments, it is...
Junichiro Mori, Yutaka Matsuo, Hitoshi Koshiba, Ke...
WWW
2008
ACM
16 years 5 months ago
Better abstractions for secure server-side scripting
bstractions for Secure Server-Side Scripting Dachuan Yu Ajay Chander Hiroshi Inamura Igor Serikov DoCoMo Communications Laboratories USA 3240 Hillview Avenue Palo Alto, CA 94304 {y...
Dachuan Yu, Ajay Chander, Hiroshi Inamura, Igor Se...