343 search results - page 28 / 69 » On Making Directed Graphs Transitive |
110
Voted
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
127
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
While the trust paradigm is essential to broadly extend the communication between the environment’s actors, the evaluation of trust becomes a challenge when confronted with init...
127
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
116
click to vote
ECEASST
2006
15 years 1 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
109
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...