Sciweavers

541 search results - page 84 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
ICDCN
2011
Springer
12 years 11 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
RTCSA
2006
IEEE
14 years 1 months ago
Instruction Scheduling with Release Times and Deadlines on ILP Processors
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
Hui Wu, Joxan Jaffar, Jingling Xue
ATAL
2007
Springer
14 years 1 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
SENSYS
2005
ACM
14 years 1 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...
ICCAD
2009
IEEE
179views Hardware» more  ICCAD 2009»
13 years 5 months ago
Automatic memory partitioning and scheduling for throughput and power optimization
Hardware acceleration is crucial in modern embedded system design to meet the explosive demands on performance and cost. Selected computation kernels for acceleration are usually ...
Jason Cong, Wei Jiang, Bin Liu, Yi Zou