Sciweavers

475 search results - page 75 / 95
» Feasible distributed CSP models for scheduling problems
Sort
View
CCGRID
2001
IEEE
13 years 11 months ago
Compute Power Market: Towards a Market-Oriented Grid
The Compute Power Market (CPM) is a market-based resource management and job scheduling system for grid computing on Internet-wide computational resources, particularly low-end pe...
Rajkumar Buyya, Sudharshan Vazhkudai
CL
2007
Springer
13 years 7 months ago
A bulk-synchronous parallel process algebra
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
Armelle Merlin, Gaétan Hains
GIS
2010
ACM
13 years 2 months ago
Supporting 3D route planning in indoor space based on the LEGO representation
With the prevalence of car navigation systems, indoor navigation systems are increasingly attracting attention in the indoor research area. However, the available models for indoo...
Wenjie Yuan, Markus Schneider
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 5 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
13 years 11 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...