Sciweavers

1445 search results - page 90 / 289
» Uniformly Hard Languages
Sort
View
ICALP
2005
Springer
14 years 3 months ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...
CSFW
2003
IEEE
14 years 3 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
SAC
2003
ACM
14 years 3 months ago
Semantic Matchmaking in a P-2-P Electronic Marketplace
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are ...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
HPDC
1998
IEEE
14 years 2 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
OOPSLA
1987
Springer
14 years 1 months ago
Metaclasses are First Class: the ObjVlisp Model
This paper shows how an attempt at a uniform and reflective definition resulted in an open-ended system supporting ObjVlisp, which we use to simulate object-oriented language exte...
Pierre Cointe