Sciweavers

835 search results - page 72 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 1 months ago
Intelligent Recombination Using Individual Learning in a Collective Learning Genetic Algorithm
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
Terry P. Riopka, Peter Bock
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 1 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
JMIV
2010
115views more  JMIV 2010»
14 years 4 months ago
Generalized Convexity in Multiple View Geometry
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments a...
Carl Olsson, Fredrik Kahl
CVPR
2009
IEEE
16 years 5 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...