1674 search results - page 256 / 335 » On the Optimality of the ARQ-DDF Protocol |
WECWIS
2002
IEEE
14 years 1 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
ASPLOS
2006
ACM
14 years 20 days ago
2006
ACM
This paper proposes new network interface controller (NIC) designs that take advantage of integration with the host CPU to provide increased flexibility for operating system kerne...
GPCE
2009
Springer
14 years 5 days ago
2009
Springer
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
EAAI
2007
13 years 9 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...