9842 search results - page 1588 / 1969 » The Complexity of the Matching-Cut Problem |
175
click to vote
ACSC
2005
IEEE
16 years 12 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
169
click to vote
ICDCS
2005
IEEE
16 years 11 days ago
2005
IEEE
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
166
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
207
click to vote
MOBICOM
2003
ACM
16 years 18 hour ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
193
click to vote
SMA
2003
ACM
16 years 15 hour ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...