Sciweavers

1205 search results - page 194 / 241
» On P Systems with Bounded Parallelism
Sort
View
APPINF
2003
13 years 9 months ago
Comparing the Optimal Performance of Multiprocessor Architectures
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, ...
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
RTAS
2008
IEEE
14 years 2 months ago
Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements
To achieve better throughput, many hard drive manufacturers use internal queues and scheduling to take advantage of vendor-specific characteristics and knowledge. While this tren...
Mark J. Stanovich, Theodore P. Baker, An-I Andy Wa...
APN
2007
Springer
14 years 1 months ago
History-Dependent Petri Nets
Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We cons...
Kees M. van Hee, Alexander Serebrenik, Natalia Sid...
ISTCS
1993
Springer
13 years 11 months ago
Analog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
Hava T. Siegelmann, Eduardo D. Sontag