174 search results - page 34 / 35 » Computer Science and Game Theory: A Brief Survey |
STOC
2004
ACM
14 years 6 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
FCT
2009
Springer
14 years 11 days ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
FOCS
2009
IEEE
14 years 16 days ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
FOCS
2009
IEEE
14 years 16 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
ICASSP
2008
IEEE
14 years 7 days ago
2008
IEEE
Pulse compression radar systems make use of transmit code sequences and receive filters that are specially designed to achieve good range resolution and target detection capabili...