Sciweavers

5624 search results - page 274 / 1125
» On Conditional Covering Problem
Sort
View
DISOPT
2006
155views more  DISOPT 2006»
15 years 6 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
SECON
2010
IEEE
15 years 4 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
IPPS
2000
IEEE
15 years 11 months ago
Take Advantage of the Computing Power of DNA Computers
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...
Zhiquan Frank Qiu, Mi Lu
ISSS
1996
IEEE
116views Hardware» more  ISSS 1996»
15 years 10 months ago
A Constructive Method for Exploiting Code Motion
In this paper we address a resource
Luiz C. V. dos Santos, Marc J. M. Heijligers, C. A...
AMC
2006
80views more  AMC 2006»
15 years 6 months ago
Equilibrium attractive properties of a class of multistep Runge-Kutta methods
The main purpose of this paper is to discuss the equilibrium attractive properties of a class of multistep Runge
Aiguo Xiao, Yifa Tang