Sciweavers

44 search results - page 3 / 9
» Minimizing Wide Range Regret with Time Selection Functions
Sort
View
JSAC
2008
125views more  JSAC 2008»
14 years 11 months ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu
EOR
2006
117views more  EOR 2006»
14 years 11 months ago
Heuristics for selecting robust database structures with dynamic query patterns
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
Andrew N. K. Chen, Paulo B. Goes, Alok Gupta, Jame...
IPPS
2000
IEEE
15 years 3 months ago
Augmenting Modern Superscalar Architectures with Configurable Extended Instructions
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
Xianfeng Zhou, Margaret Martonosi
JCO
2007
100views more  JCO 2007»
14 years 11 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
BMCBI
2008
218views more  BMCBI 2008»
14 years 11 months ago
LOSITAN: A workbench to detect molecular adaptation based on a Fst-outlier method
Background: Testing for selection is becoming one of the most important steps in the analysis of multilocus population genetics data sets. Existing applications are difficult to u...
Tiago Antao, Ana Lopes, Ricardo J. Lopes, Albano B...