5230 search results - page 144 / 1046 » Dynamic Optimality -- Almost |
122
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
It is generally acknowledged that many experts and almost all lay persons have difficulty in formulating requests for information in such a manner that conventional off-line Infor...
129
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
107
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
We are interested in schema disruption behavior when chromosomes are structured as binary trees. We give the definition of the disruption probability dp(H) of a schema H, and also...
161
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
153
Voted
DSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...