4266 search results - page 286 / 854 » The container loading problem |
141
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
115
click to vote
CIVR
2005
Springer
15 years 10 months ago
2005
Springer
Matching people based on their imaged face is hard because of the well known problems of illumination, pose, size and expression variation. Indeed these variations can exceed those...
130
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
151
click to vote
KES
2004
Springer
15 years 10 months ago
2004
Springer
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
158
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...