9842 search results - page 322 / 1969 » The Complexity of the Matching-Cut Problem |
134
click to vote
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
162
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
125
Voted
AH
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The virtual laboratory (VILAB) supports interactive problem solving in computer science with access to complex software-tools. During the problem solving processes the le...
139
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
120
Voted
WEBDB
2004
Springer
15 years 9 months ago
2004
Springer
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have t...