273 search results - page 33 / 55 » Can Pure Cutting Plane Algorithms Work |
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Though destructive to network functions, insider attackers are not detectable with only the classic cryptographybased techniques. Many mission-critic sensor network application...
CGI
2003
IEEE
14 years 25 days ago
2003
IEEE
High quality, virtual 3D models are quickly emerging as a new multimedia data type with applications in such diverse areas as e-commerce, online encyclopaedias, or virtual museums...
GD
1995
Springer
13 years 11 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...