2907 search results - page 367 / 582 » Presentations of Structures in Admissible Sets |
232
click to vote
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
206
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
198
click to vote
ATS
2010
IEEE
15 years 3 months ago
2010
IEEE
Systems with many integrated circuits (ICs), often of the same type, are increasingly common to meet the constant performance demand. However, systems in recent semiconductor techn...
178
click to vote
DAM
2011
15 years 1 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
174
click to vote
COGSR
2011
15 years 1 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...