2085 search results - page 265 / 417 » Special interest groups |
130
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
112
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
117
Voted
CEC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
104
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
93
Voted
CLUSTER
2004
IEEE
15 years 4 months ago
2004
IEEE
Modern computational science applications are becoming increasingly multi-disciplinaty involving widely distributed research teams and their underlying computational platforms. A ...