Sciweavers

1933 search results - page 336 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
13 years 11 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
DAC
2010
ACM
13 years 11 months ago
Performance yield-driven task allocation and scheduling for MPSoCs under process variation
With the ever-increasing transistor variability in CMOS technology, it is essential to integrate variation-aware performance analysis into the task allocation and scheduling proce...
Lin Huang, Qiang Xu
ATAL
2006
Springer
13 years 11 months ago
Learning the required number of agents for complex tasks
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa
FPGA
2008
ACM
184views FPGA» more  FPGA 2008»
13 years 9 months ago
Mapping for better than worst-case delays in LUT-based FPGA designs
Current advances in chip design and manufacturing have allowed IC manufacturing to approach the nanometer range. As the feature size scales down, greater variability is experience...
Kirill Minkovich, Jason Cong
CIIT
2004
104views Communications» more  CIIT 2004»
13 years 9 months ago
Semi-automatic compensation of the propagation delay in fault-tolerant systems
In control systems the jitter is a major problem since in a time-varying system the theoretical results for analysis and design of time-invariant systems cannot be used directly. ...
Thomas Losert, Wilfried Elmenreich, Martin Schlage...