Sciweavers

936 search results - page 163 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
TII
2010
124views Education» more  TII 2010»
14 years 6 months ago
Address-Independent Estimation of the Worst-case Memory Performance
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...
Basilio B. Fraguela, Diego Andrade, Ramon Doallo
JCIT
2008
138views more  JCIT 2008»
14 years 11 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
INFOCOM
2011
IEEE
14 years 3 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
IFIP
2000
Springer
15 years 3 months ago
Information Systems Conceptual Foundations: Looking Backward and Forward
The academic field of information systems has developed because organizations use a specialized body of knowledge about information and communications systems. Teaching and resear...
Gordon B. Davis
ATAL
2008
Springer
15 years 1 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan