Sciweavers

11740 search results - page 269 / 2348
» More Problems in Rewriting
Sort
View
ICML
2004
IEEE
16 years 1 days ago
Active learning of label ranking functions
The effort necessary to construct labeled sets of examples in a supervised learning scenario is often disregarded, though in many applications, it is a time-consuming and expensi...
Klaus Brinker
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 11 months ago
Tournament Selection: Stable Fitness Pressure in XCS
Abstract. Although it is known from GA literature that proportionate selection is subject to many pitfalls, the LCS community somewhat adhered to proportionate selection. Also in t...
Martin Butz, Kumara Sastry, David E. Goldberg
DBSEC
2000
117views Database» more  DBSEC 2000»
15 years 8 months ago
Database Security 2000
Database systems are being more and more used, with larger sized databases, and as components of very complex systems, that include numerous protocols. Database security problems ...
John R. Campbell
JC
2007
130views more  JC 2007»
15 years 6 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
ICST
2011
IEEE
14 years 10 months ago
Assessing Oracle Quality with Checked Coverage
—A known problem of traditional coverage metrics is that they do not assess oracle quality—that is, whether the computation result is actually checked against expectations. In ...
David Schuler, Andreas Zeller