9842 search results - page 392 / 1969 » The Complexity of the Matching-Cut Problem |
146
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
192
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
115
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
168
click to vote
ICAC
2009
IEEE
15 years 11 months ago
2009
IEEE
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
279
click to vote
PADL
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...