12289 search results - page 172 / 2458 » computing 2006 |
117
click to vote
CG
2006
Springer
15 years 7 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
116
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
ICNS
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— The theory of promises describes policy governed services, in a framework of completely autonomous agents, which assist one another by voluntary cooperation alone. We p...
122
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
126
Voted
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
elow are abstracts of student-faculty collaborative work presented at regional, national, and international conferences. Gregory Adkins, Elizabeth Carter, Amanda Micai, and Sarah M...