14515 search results - page 2619 / 2903 » Efficient Embedded Computing |
179
click to vote
ECCC
2008
15 years 6 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
146
click to vote
ECEASST
2008
15 years 6 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
226
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
184
click to vote
ENTCS
2008
15 years 6 months ago
2008
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
192
click to vote
ENTCS
2008
15 years 6 months ago
2008
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...