8413 search results - page 208 / 1683 » Ordering Problem Subgoals |
ICMAS
1998
15 years 2 months ago
1998
This paper describes how multiple interacting swarms of adaptive mobile agents can be used to solve problems in networks. The paper introduces a new architectural description for ...
120
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
Classification problems in critical applications such as health care or security often require very high reliability because of the high costs of errors. In order to achieve this r...
101
click to vote
ICASSP
2010
IEEE
15 years 27 days ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
124
click to vote
AHSWN
2010
15 years 25 days ago
2010
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
81
Voted
COR
2010
15 years 24 days ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...