936 search results - page 145 / 188 » Task Graph Scheduling Using Timed Automata |
119
click to vote
TSP
2008
15 years 1 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
143
click to vote
SAC
2008
ACM
15 years 25 days ago
2008
ACM
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
IV
2003
IEEE
15 years 6 months ago
2003
IEEE
In the paper, we suggest a set of visualization-based exploratory tools to support analysis and comparison of different spatial development scenarios, such as results of simulatio...
102
click to vote
AAAI
1990
15 years 2 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
128
click to vote
JPDC
2010
14 years 11 months ago
2010
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...