Sciweavers

26354 search results - page 5057 / 5271
» How we refactor, and how we know it
Sort
View
126
Voted
ATAL
2009
Springer
15 years 8 months ago
Reward shaping for valuing communications during multi-agent coordination
Decentralised coordination in multi-agent systems is typically achieved using communication. However, in many cases, communication is expensive to utilise because there is limited...
Simon A. Williamson, Enrico H. Gerding, Nicholas R...
CIKM
2009
Springer
15 years 8 months ago
P-Rank: a comprehensive structural similarity measure over information networks
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
Peixiang Zhao, Jiawei Han, Yizhou Sun
120
Voted
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 8 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
COCOON
2009
Springer
15 years 8 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
128
Voted
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 8 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
« Prev « First page 5057 / 5271 Last » Next »