4342 search results - page 339 / 869 » Improved Algorithms for Optimal Embeddings |
181
click to vote
ACL
2010
15 years 4 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
150
click to vote
WADS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
222
Voted
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
187
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
191
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...