2084 search results - page 172 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
171
Voted
RTCSA
2003
IEEE
15 years 10 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
155
Voted
ANTS
2006
Springer
15 years 8 months ago
2006
Springer
Despite their popularity, lattice reduction algorithms remain mysterious in many ways. It has been widely reported that they behave much more nicely than what was expected from the...
149
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
150
Voted
ICIAP
1999
ACM
15 years 9 months ago
1999
ACM
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
165
click to vote
CP
1997
Springer
15 years 9 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...