Sciweavers

458 search results - page 75 / 92
» Universal Temporal Data Languages
Sort
View
ASPLOS
1989
ACM
15 years 3 months ago
Architecture and Compiler Tradeoffs for a Long Instruction Word Microprocessor
A very long instruction word (VLIW) processorexploits parallelism by controlling multiple operations in a single instruction word. This paper describes the architecture and compil...
Robert Cohn, Thomas R. Gross, Monica S. Lam, P. S....
CTCS
1989
Springer
15 years 3 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
WWW
2008
ACM
16 years 14 days ago
Exploring social annotations for information retrieval
Social annotation has gained increasing popularity in many Web-based applications, leading to an emerging research area in text analysis and information retrieval. This paper is c...
Ding Zhou, Jiang Bian, Shuyi Zheng, Hongyuan Zha, ...
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
15 years 5 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
HPDC
1998
IEEE
15 years 4 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon