9842 search results - page 1640 / 1969 » The Complexity of the Matching-Cut Problem |
188
click to vote
CD
2005
Springer
16 years 7 days ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall av...
185
click to vote
DCOSS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
163
click to vote
DEXA
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
199
Voted
ECAL
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Many researchers are developing frameworks inspired by natural, especially biological, systems to solve complex real-world problems. This work extends previous work in th...
173
click to vote
EGH
2005
Springer
16 years 6 days ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...