530 search results - page 90 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
AI
1998
Springer
13 years 7 months ago
1998
Springer
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where ...
COMCOM
2006
13 years 7 months ago
2006
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...