161 search results - page 21 / 33 » Structural decompositions for problems with global constrain... |
NPAR
2004
ACM
15 years 3 months ago
2004
ACM
Creating a portrait in the style of a particular artistic tradition or a particular artist is a difficult problem. Elusive to codify algorithmically, the nebulous qualities which...
JAIR
2006
14 years 9 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
to appear in Proc. IEEE Int’l Conf. on Acoustics, Speech, and Signal Processing, March, 2008 High-dynamic-range medical images take intensity values which cannot be visualized o...
95
Voted
TSMC
2008
14 years 9 months ago
2008
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...