Sciweavers

8413 search results - page 254 / 1683
» Ordering Problem Subgoals
Sort
View
107
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer
CVPR
1999
IEEE
16 years 3 months ago
High-Level and Generic Models for Visual Search: When Does High Level Knowledge Help?
We analyze the problem of detecting a road target in background clutter and investigate the amount of prior (i.e. target specific) knowledge needed to perform this search task. Th...
Alan L. Yuille, James M. Coughlan
111
Voted
CCCG
2010
15 years 2 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
101
Voted
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
14 years 8 months ago
Nonholonomic source seeking in switching random fields
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pa...
IPL
2011
73views more  IPL 2011»
14 years 8 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa