1201 search results - page 166 / 241 » Linear Probing and Graphs |
140
Voted
LOGCOM
1998
15 years 9 days ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
149
Voted
MP
2011
14 years 7 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
113
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
141
Voted
COMGEO
2006
ACM
15 years 20 days ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
121
Voted
DM
2006
15 years 20 days ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...