117 search results - page 23 / 24 » On Superlinear Lower Bounds in Complexity Theory |
EMSOFT
2009
Springer
13 years 11 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
ALT
1995
Springer
13 years 11 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
EMSOFT
2010
Springer
13 years 5 months ago
2010
Springer
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...