Sciweavers

1257 search results - page 228 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
IAT
2003
IEEE
15 years 3 months ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings
SIGCOMM
2009
ACM
15 years 4 months ago
Economic issues in shared infrastructures
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
Costas Courcoubetis, Richard R. Weber
DAC
2008
ACM
15 years 11 months ago
Partial order reduction for scalable testing of systemC TLM designs
A SystemC simulation kernel consists of a deterministic implementation of the scheduler, whose specification is nondeterministic. To leverage testing of a SystemC TLM design, we f...
Sudipta Kundu, Malay K. Ganai, Rajesh Gupta
WG
2009
Springer
15 years 4 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
STOC
1998
ACM
108views Algorithms» more  STOC 1998»
15 years 2 months ago
On Indexed Data Broadcast
We consider the problem of efficient information retrieval in asymmetric communication environments where multiple clients with limited resources retrieve information from a power...
Sanjeev Khanna, Shiyu Zhou