4047 search results - page 272 / 810 » Algebraic Model Checking |
152
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
183
click to vote
RTCSA
1999
IEEE
15 years 11 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
158
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
209
click to vote
IANDC
2011
15 years 1 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
176
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
We present an algebraic solution to direct registration of diffusion tensor images under various local deformation models. We show how to linearly recover the deformation from the...