Sciweavers

1743 search results - page 245 / 349
» Generalized Modal Satisfiability
Sort
View
PODC
1993
ACM
15 years 8 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
AINA
2007
IEEE
15 years 8 months ago
Using Argumentative Agents to Manage Communities of Web Services
This paper presents a framework for specifying Web services communities. A Web service is an accessible application that humans, software agents, and other applications in general ...
Jamal Bentahar, Zakaria Maamar, Djamal Benslimane,...
CONCUR
2007
Springer
15 years 8 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
DAC
2007
ACM
15 years 8 months ago
Skewed Flip-Flop Transformation for Minimizing Leakage in Sequential Circuits
Mixed Vt has been widely used to control leakage without affecting circuit performance. However, current approaches target the combinational circuits even though sequential elemen...
Jun Seomun, Jaehyun Kim, Youngsoo Shin
DAC
2009
ACM
15 years 8 months ago
RegPlace: a high quality open-source placement framework for structured ASICs
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
Ashutosh Chakraborty, Anurag Kumar, David Z. Pan