Sciweavers

4356 search results - page 351 / 872
» Communicating Transactions - (Extended Abstract)
Sort
View
ITA
2007
15 years 6 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
JCM
2007
81views more  JCM 2007»
15 years 6 months ago
Some Analysis in Distributed MIMO Systems
Abstract—The predicted capacity gain of a traditional colocated MIMO system is often severely limited in realistic propagation scenarios, especially when the number of antennas b...
Huaiyu Dai, Hongyuan Zhang, Quan Zhou
JSAC
2007
86views more  JSAC 2007»
15 years 6 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
Petros Elia, Frédérique E. Oggier, P...
INFORMATICALT
2000
157views more  INFORMATICALT 2000»
15 years 6 months ago
The Analysis of Unstructured Processes in Business Administration
Abstract. One of the problem in business process reengineering is the identification and implementation of new workflow procedures for specific business processes, if they are not ...
Alvydas Jaliniauskas
FUIN
2002
80views more  FUIN 2002»
15 years 6 months ago
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
Joaquin Aguado, Tudor Balanescu, Anthony J. Cowlin...