1012 search results - page 63 / 203 » Segment intersection searching problems in general settings |
117
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
AAAI
2000
15 years 1 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
100
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
165
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
CP
2006
Springer
15 years 3 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...