707 search results - page 105 / 142 » Solving path problems on the GPU |
100
click to vote
RECOMB
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
100
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Dynamic spectrum access has been proposed as a means to share scarce radio resources, and requires devices to follow protocols that use resources in a proper, disciplined manner...
112
click to vote
MDM
2009
Springer
15 years 6 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
DAC
2004
ACM
15 years 5 months ago
2004
ACM
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
140
click to vote
AAAI
2008
15 years 2 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...