18306 search results - page 355 / 3662 » Algorithmics in Exponential Time |
186
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
220
click to vote
ISORC
2008
IEEE
16 years 1 months ago
2008
IEEE
Effective resource management for distributed real-time embedded (DRE) systems is hard due to their unique characteristics, including (1) constraints in multiple resources and (2)...
181
Voted
RSKT
2009
Springer
15 years 11 months ago
2009
Springer
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
235
click to vote
RTCSA
1999
IEEE
15 years 11 months ago
1999
IEEE
Replication is a well-know fault-tolerance technique, and several replication strategies exist (e.g. active, passive, and semi-active replication). To be used in hard real-time sy...
149
click to vote
JPDC
2000
15 years 6 months ago
2000
In this paper we propose a new minimum total communication distance T CD algorithm and an optimal T CD algorithm for broadcast in a 3-dimensional mesh 3-D mesh. The former generat...