13306 search results - page 294 / 2662 » Theoretical Computer Science |
160
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
139
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly
151
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
We extend the results of [2] by computing conformal maps onto the canonical slit domains in Nehari [14]. Along the way, we demonstrate the computability of solutions to Neuman prob...
122
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
143
click to vote
ITICSE
2000
ACM
15 years 11 months ago
2000
ACM
We describe a project exploring the relationships between factors in the learning environment, student well-being and learning outcomes, in the context of a Computing department. ...