57 search results - page 11 / 12 » Pebbling and Branching Programs Solving the Tree Evaluation ... |
CJ
2004
13 years 5 months ago
2004
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
GLOBECOM
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
ALGORITHMICA
2002
13 years 5 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
ICSE
2010
IEEE-ACM
13 years 10 months ago
2010
IEEE-ACM
Statistical debugging uses lightweight instrumentation and statistical models to identify program behaviors that are strongly predictive of failure. However, most software is most...
JAIR
2007
13 years 5 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...