494 search results - page 77 / 99 » Probabilistic Programming in Anglican |
ICTAI
1999
IEEE
15 years 2 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
ICALP
1990
Springer
15 years 2 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
ENTCS
2010
14 years 10 months ago
2010
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
JCO
1998
14 years 9 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
TSE
2002
14 years 9 months ago
2002
Software system documentation is almost always expressed informally in natural language and free text. Examples include requirement specifications, design documents, manual pages, ...