Sciweavers

1132 search results - page 21 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling Laws for Wireless Networks with Fading Channels
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...
ALT
1998
Springer
13 years 11 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ERSHOV
2003
Springer
14 years 18 days ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
SAGT
2010
Springer
223views Game Theory» more  SAGT 2010»
13 years 5 months ago
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
Vittorio Bilò, Ioannis Caragiannis, Angelo ...
FOSSACS
2007
Springer
14 years 1 months ago
A Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
Anca Muscholl, Igor Walukiewicz