580 search results - page 91 / 116 » Building a Family of Compilers |
UAI
2004
13 years 9 months ago
2004
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
AAAI
2000
13 years 9 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
AUTOMATICA
2008
13 years 7 months ago
2008
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
JUCS
2006
13 years 7 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
APAL
2004
13 years 7 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...