Sciweavers

4498 search results - page 326 / 900
» How to Invent Functions
Sort
View
SIGMOD
1998
ACM
89views Database» more  SIGMOD 1998»
15 years 9 months ago
Secure and Portable Database Extensibility
The functionality of extensible database servers can be augmented by user-de ned functions UDFs. However, the server's security and stability are concerns whenever new code...
Michael W. Godfrey, Tobias Mayr, Praveen Seshadri,...
ATAL
2006
Springer
15 years 8 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
DELTA
2004
IEEE
15 years 8 months ago
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
DSN
2004
IEEE
15 years 8 months ago
Robust Aggregation Protocols for Large-Scale Overlay Networks
Aggregation refers to a set of functions that provide global information about a distributed system. These functions operate on numeric values distributed over the system and can ...
Alberto Montresor, Márk Jelasity, Özal...
FLOPS
2004
Springer
15 years 8 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...