334 search results - page 13 / 67 » A New Parallel Algorithm for Generalized LR Parsing |
108
Voted
GECCO
2005
Springer
15 years 5 months 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 ...
113
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
100
Voted
TALG
2008
14 years 11 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
ICCD
2007
IEEE
15 years 8 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
110
Voted
AE
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...