3229 search results - page 159 / 646 » The Theory of Timed Automata |
163
click to vote
ISCC
2008
IEEE
16 years 27 days ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
167
click to vote
DATE
2006
IEEE
16 years 17 days ago
2006
IEEE
In this paper we present a method which allows the statistical analysis of nanoelectronic Boolean networks with respect to timing uncertainty and noise. All signals are considered...
178
click to vote
FM
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. UnifyingTheoriesofProgramming(UTP)canprovideaformalsemantic foundation not only for programming languages but also for more expressive specification languages. We believ...
160
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
187
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...