9842 search results - page 1689 / 1969 » The Complexity of the Matching-Cut Problem |
139
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
140
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
169
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
132
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
159
click to vote
KI
2007
Springer
15 years 10 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...