990 search results - page 160 / 198 » Using evolution strategies to solve DEC-POMDP problems |
145
Voted
ENTCS
2007
15 years 3 months ago
2007
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
136
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
132
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
131
click to vote
WIMOB
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
148
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...