1201 search results - page 140 / 241 » Linear Probing and Graphs |
132
Voted
HCW
1999
IEEE
15 years 5 months ago
1999
IEEE
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
123
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
123
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
97
Voted
EACL
2006
ACL Anthology
15 years 2 months ago
2006
ACL Anthology
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
113
click to vote
IPL
2006
15 years 20 days ago
2006
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...