77 search results - page 5 / 16 » Timing optimization by restructuring long combinatorial path... |
119
Voted
NHM
2010
14 years 9 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
114
Voted
MIG
2010
Springer
15 years 1 months ago
2010
Springer
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
131
Voted
MOR
2000
15 years 2 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
126
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
136
click to vote
ICNC
2005
Springer
15 years 8 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...