1197 search results - page 99 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
IJRR
2000
13 years 8 months ago
2000
The inverse kinematics problem is formulated as a parameterized autonomous dynamical system problem, and respective analysis is carried out. It is shown that a singular point of w...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...