725 search results - page 92 / 145 » heuristics 2010 |
172
click to vote
MST
2010
15 years 3 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
146
click to vote
SAC
2010
ACM
16 years 10 days ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
166
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
169
click to vote
ICWS
2010
IEEE
15 years 7 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
164
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...