1969 search results - page 383 / 394 » Financial Theory 1 |
IOR
2007
13 years 7 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
IPL
2007
13 years 7 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
TIFS
2008
13 years 7 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
TSP
2008
13 years 7 months ago
2008
We consider the design of cooperation coding schemes for a two-user multi-access channel (MAC). In particular, we consider two block Markov coding schemes, namely, the multiplexed...
AAMAS
2002
Springer
13 years 7 months ago
2002
Springer
We control a population of interacting software agents. The agents have a strategy, and receive a payoff for executing that strategy. Unsuccessful agents become extinct. We investi...