3510 search results - page 189 / 702 » Searching with numbers |
177
click to vote
JCDL
2011
ACM
14 years 9 months ago
2011
ACM
The Memento Project’s archive access additions to HTTP have enabled development of new web archive access user interfaces. After experiencing this web time travel, the inevitabl...
166
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
201
click to vote
AUSAI
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
160
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
140
click to vote
AAMAS
2005
Springer
16 years 5 days ago
2005
Springer
It is difficult to define a set of rules for a cellular automaton (CA) such that creatures with life-like properties (stability and dynamic behaviour, reproducton and self-repai...