738 search results - page 48 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
EUC
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the u...
129
click to vote
SENSYS
2006
ACM
15 years 3 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
WDAG
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...