4860 search results - page 381 / 972 » SNPs Problems, Complexity, and Algorithms |
220
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
191
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
159
click to vote
ISPD
1999
ACM
15 years 11 months ago
1999
ACM
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
189
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
177
click to vote
FLAIRS
2008
15 years 9 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...