10051 search results - page 358 / 2011 » A Dynamic Separator Algorithm |
218
click to vote
TPDS
2010
15 years 5 months ago
2010
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
310
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
209
click to vote
ARCS
2004
Springer
16 years 22 days ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
154
click to vote
PPSN
2004
Springer
16 years 20 days ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
169
click to vote
AAAI
2010
15 years 8 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...