Sciweavers

926 search results - page 161 / 186
» Prolog as the First Programming Language
Sort
View
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 6 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
145
Voted
ASPLOS
2008
ACM
15 years 4 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
118
Voted
ASPLOS
2008
ACM
15 years 4 months ago
No "power" struggles: coordinated multi-level power management for the data center
Power delivery, electricity consumption, and heat management are becoming key challenges in data center environments. Several past solutions have individually evaluated different ...
Ramya Raghavendra, Parthasarathy Ranganathan, Vani...
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 2 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
150
Voted
WWW
2003
ACM
16 years 3 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon