9842 search results - page 1546 / 1969 » The Complexity of the Matching-Cut Problem |
176
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
216
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
190
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
180
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
181
click to vote
ENGL
2008
15 years 6 months ago
2008
High performance computing is becoming increasingly important in the field of financial computing, as the complexity of financial models continues to increase. Many of these financ...