10988 search results - page 376 / 2198 » Algorithmic Folding Complexity |
170
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
183
click to vote
TCAD
2008
15 years 3 months ago
2008
In this paper, we propose a high-performance droplet router for a digital microfluidic biochip (DMFB) design. Due to recent advancements in the biomicroelectromechanical system and...
164
Voted
MICRO
2010
IEEE
15 years 2 months ago
2010
IEEE
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
179
click to vote
CEC
2010
IEEE
14 years 8 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
157
Voted
RTAS
1995
IEEE
15 years 8 months ago
1995
IEEE
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision for a given real...