4865 search results - page 889 / 973 » The Complexity of Graph Connectivity |
EMSOFT
2010
Springer
13 years 8 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
FORMATS
2010
Springer
13 years 8 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
SEMWEB
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...
SPIN
2010
Springer
13 years 8 months ago
2010
Springer
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches en...
EKNOW
2009
13 years 8 months ago
2009
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...