2774 search results - page 306 / 555 » Exploiting Deep Structure |
144
click to vote
FMSD
2007
15 years 6 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
192
click to vote
STTT
2008
15 years 6 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
171
click to vote
TCS
2008
15 years 6 months ago
2008
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
148
click to vote
JGT
2007
15 years 6 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
125
click to vote
TWC
2008
15 years 6 months ago
2008
This contribution deals with code-aided hypothesis testing for wireless digital receivers. We provide a theoretical justification for a hypothesis testing algorithm that was previo...