Sciweavers

120 search results - page 22 / 24
» On Bin Packing with Conflicts
Sort
View
MOBIQUITOUS
2005
IEEE
13 years 11 months ago
Multi-Constraint Dynamic Access Selection in Always Best Connected Networks
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
Bo Xing, Nalini Venkatasubramanian
CLUSTER
2003
IEEE
13 years 11 months ago
Interstitial Computing: Utilizing Spare Cycles on Supercomputers
This paper presents an analysis of utilizing unused cycles on supercomputers through the use of many small jobs. What we call “interstitial computing,” is important to superco...
Stephen D. Kleban, Scott H. Clearwater
IPPS
2003
IEEE
13 years 11 months ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
13 years 10 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
13 years 10 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan