111 search results - page 15 / 23 » The Hamiltonian p-Median Problem |
110
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
106
Voted
AUTOMATICA
1999
15 years 11 days ago
1999
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
105
click to vote
FCS
2006
15 years 2 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...
104
click to vote
DNA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...