Sciweavers

641 search results - page 104 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 3 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
GECCO
2010
Springer
153views Optimization» more  GECCO 2010»
15 years 29 days ago
Multi-task evolutionary shaping without pre-specified representations
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
Matthijs Snel, Shimon Whiteson
ASSETS
2010
ACM
14 years 4 months ago
Broadening accessibility through special interests: a new approach for software customization
Individuals diagnosed with autism spectrum disorder (ASD) often fixate on narrow, restricted interests. These interests can be highly motivating, but they can also create attentio...
Robert R. Morris, Connor R. Kirschbaum, Rosalind W...
SIGCOMM
2009
ACM
15 years 4 months ago
Matchmaking for online games and other latency-sensitive P2P systems
– The latency between machines on the Internet can dramatically affect users’ experience for many distributed applications. Particularly, in multiplayer online games, players s...
Sharad Agarwal, Jacob R. Lorch
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
15 years 10 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...