Sciweavers

752 search results - page 57 / 151
» The standard parts problem and the complexity of control com...
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 12 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
HYBRID
2011
Springer
12 years 7 months ago
Reputation-based networked control with data-corrupting channels
We examine the problem of reliable networked control when the communication channel between the controller and the actuator periodically drops packets and is faulty i.e., corrupts...
Shreyas Sundaram, Jian Chang, Krishna K. Venkatasu...
JSS
2007
67views more  JSS 2007»
13 years 7 months ago
TFRP: An efficient microaggregation algorithm for statistical disclosure control
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
Chin-Chen Chang, Yu-Chiang Li, Wen-Hung Huang
TASE
2008
IEEE
13 years 7 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
PPSN
1998
Springer
13 years 11 months ago
Comparison of Evolutionary Algorithms for Design Optimization
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...