12015 search results - page 425 / 2403 » Interactive Algorithms 2005 |
124
click to vote
ENTCS
2000
15 years 4 months ago
2000
The NuPRL system [3] was designed for interactive writing of machine
116
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
152
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
123
Voted
SPIRE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
189
click to vote
TAINN
2005
Springer
15 years 10 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...