603 search results - page 58 / 121 » A General Approximation Technique for Constrained Forest Pro... |
101
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
121
Voted
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
103
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
107
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
110
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...