Sciweavers

504 search results - page 26 / 101
» Complexity Properties of Restricted Abstract Argument System...
Sort
View
SIGCOMM
2012
ACM
13 years 3 days ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 8 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
ICTCS
2003
Springer
15 years 2 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
DASFAA
2010
IEEE
166views Database» more  DASFAA 2010»
15 years 4 months ago
The Objects Interaction Matrix for Modeling Cardinal Directions in Spatial Databases
Abstract. Besides topological relations and approximate relations, cardinal directions have turned out to be an important class of qualitative spatial relations. In spatial databas...
Tao Chen, Markus Schneider, Ganesh Viswanathan, We...
CIE
2007
Springer
15 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer