299 search results - page 20 / 60 » Dispositional implementation solves the superfluous structur... |
ESOP
1999
Springer
14 years 22 days ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
—Traditionally, simultaneous localization and mapping (SLAM) algorithms solve the localization and mapping problem in explored regions. This paper presents a prediction-based SLA...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
Berners-Lee’s compelling vision of a Semantic Web is hindered by a chicken-and-egg problem, which can be best solved by a bootstrapping method — creating enough structured dat...