2681 search results - page 203 / 537 » Problem F |
136
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
107
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
118
Voted
DAM
2008
15 years 24 days ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
99
Voted
PPL
2007
15 years 6 days ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
91
Voted
HICSS
2002
IEEE
15 years 5 months ago
2002
IEEE
The disorientation problem has been known to exist on hypertext and hypermedia systems. Various approaches have also been recommended and implemented in order to eliminate or redu...