2313 search results - page 225 / 463 » On Heuristic Time Hierarchies |
178
click to vote
LCN
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Distributed interactive applications may have stringent latency requirements and dynamic user groups. These applications may benefit from a group communication system, ...
189
click to vote
CEC
2007
IEEE
16 years 29 days ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
168
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
157
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
166
click to vote
EVOW
2007
Springer
16 years 24 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...