80
Voted
ACMSE
2010
ACM
14 years 10 months ago
2010
ACM
115
Voted
ACMSE
2010
ACM
14 years 10 months ago
2010
ACM
Most present day search engines have a deterministic behavior in the sense that they return the same search results for all users who submit the same query at a certain time. They...
77
Voted
ACMSE
2010
ACM
14 years 10 months ago
2010
ACM
92
Voted
ACMSE
2010
ACM
14 years 10 months ago
2010
ACM
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...
101
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
110
click to vote
WG
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
127
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
119
click to vote
WG
2010
Springer
14 years 11 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
WG
2010
Springer
14 years 11 months ago
2010
Springer