2191 search results - page 156 / 439 » Improving the Efficiency of Non-Deterministic Computations |
120
Voted
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
101
Voted
RIAO
2000
15 years 2 months ago
2000
Given a set of categories, with or without a preexisting hierarchy among them, we consider the problem of assigning documents to one or more of these categories from the point of ...
COMPUTER
1999
15 years 21 days ago
1999
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
109
Voted
JPDC
2006
15 years 29 days ago
2006
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
104
Voted
RT
2000
Springer
15 years 4 months ago
2000
Springer
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...