610 search results - page 83 / 122 » Solving Geometrical Place Problems by using Evolutionary Alg... |
136
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
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...
133
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
143
Voted
AAAI
2008
15 years 5 months ago
2008
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
106
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
123
Voted
GPEM
2002
15 years 3 months ago
2002
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...