4378 search results - page 191 / 876 » On the Complexity of Ordered Colourings |
182
click to vote
COMPLIFE
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
199
click to vote
WCC
2005
Springer
16 years 1 days ago
2005
Springer
Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members o...
171
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
This study describes how complex goal-directed behavior can evolve in a hierarchically organized recurrent neural network controlling a simulated Khepera robot. Different types of ...
155
click to vote
WEA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
141
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...