3837 search results - page 123 / 768 » Learning Approximate Consistencies |
133
Voted
EUROGP
2009
Springer
15 years 11 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
147
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
147
click to vote
ICON
2007
IEEE
15 years 10 months ago
2007
IEEE
- In this paper we analyze the performance, utilization, and power estimation of server systems by both adopting the batch service and adjusting the batch size. In addition to redu...
171
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
142
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...