Sciweavers

1814 search results - page 308 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ACSAC
2007
IEEE
15 years 3 months ago
Toward a Medium-Robustness Separation Kernel Protection Profile
A protection profile for high-robustness separation kernels has recently been validated and several implementations are under development. However, medium-robustness separation ke...
Rance J. DeLong, Thuy D. Nguyen, Cynthia E. Irvine...
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 3 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
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
15 years 3 months ago
Schema Mapping in P2P Networks Based on Classification and Probing
In this paper, we address the problems of adaptive schema mappings between different peers in peer-to-peer network and searching for interesting data residing at different peers ba...
Guoliang Li, Beng Chin Ooi, Bei Yu, Lizhu Zhou
DAC
2010
ACM
15 years 3 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
15 years 3 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