2774 search results - page 202 / 555 » Exploiting Deep Structure |
175
click to vote
HOTOS
1993
IEEE
15 years 10 months ago
1993
IEEE
The current generation of le systems are inadequate in facing the new technological challenges of wide area networks and massive storage. xFS is a prototype le system we are devel...
179
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
Symmetry reduction techniques can help to combat the state space explosion problem for model checking, but are restricted by the hard problem of determining equivalence of states d...
157
click to vote
PARA
1995
Springer
15 years 10 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
181
click to vote
AIPS
2007
15 years 9 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
183
click to vote
IPCO
2008
15 years 8 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...