4432 search results - page 95 / 887 » Solving Demodulation as an Optimization Problem |
125
Voted
AUSAI
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
130
Voted
NETCOOP
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
117
Voted
CVPR
2001
IEEE
16 years 4 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
101
Voted
ISVC
2007
Springer
15 years 8 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
129
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...