Sciweavers

2027 search results - page 289 / 406
» Approximating power indices
Sort
View
AAAI
2008
15 years 8 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
FLAIRS
2008
15 years 8 months ago
Recovering from Inconsistency in Distributed Simple Temporal Networks
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
Anthony Gallagher, Stephen F. Smith
ACMACE
2008
ACM
15 years 8 months ago
Evaluation of a pervasive game for domestic energy engagement among teenagers
In this paper, we present Power Agent - a pervasive game designed to encourage teenagers and their families to reduce energy consumption in the home. The idea behind this mobile p...
Anton Gustafsson, Magnus Bång
APLAS
2008
ACM
15 years 8 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...
ATS
2005
IEEE
164views Hardware» more  ATS 2005»
15 years 8 months ago
A Family of Logical Fault Models for Reversible Circuits
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
Ilia Polian, Thomas Fiehn, Bernd Becker, John P. H...