2283 search results - page 146 / 457 » Bounds of Graph Characteristics |
154
Voted
AOR
2010
15 years 25 days ago
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
151
click to vote
DSN
2007
IEEE
15 years 7 months ago
2007
IEEE
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
159
Voted
JSSPP
2007
Springer
15 years 9 months ago
2007
Springer
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
121
click to vote
RTAS
2005
IEEE
15 years 9 months ago
2005
IEEE
Dynamic voltage and frequency scaling is increasingly being used to reduce the energy requirements of embedded and real-time applications by exploiting idle CPU resources, while s...
140
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...