Sciweavers

451 search results - page 74 / 91
» Temporal Classes and OWL
Sort
View
82
Voted
IPPS
2009
IEEE
15 years 7 months ago
On scheduling dags to maximize area
A new quality metric, called area, is introduced for schedules that execute dags, i.e., computations having intertask dependencies. Motivated by the temporal unpredictability enco...
Gennaro Cordasco, Arnold L. Rosenberg
102
Voted
CONCUR
2009
Springer
15 years 7 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
91
Voted
ICIP
2007
IEEE
15 years 6 months ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
SECON
2007
IEEE
15 years 6 months ago
Adaptive Control of Duty Cycling in Energy-Harvesting Wireless Sensor Networks
—Increasingly many wireless sensor network deployments are using harvested environmental energy to extend system lifetime. Because the temporal profiles of such energy sources e...
Christopher M. Vigorito, Deepak Ganesan, Andrew G....
122
Voted
LFCS
2007
Springer
15 years 6 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden