Sciweavers

7380 search results - page 354 / 1476
» time 2008
Sort
View
IOR
2008
105views more  IOR 2008»
15 years 6 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao
JCO
2008
76views more  JCO 2008»
15 years 6 months ago
On the inapproximability of the exemplar conserved interval distance problem of genomes
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Z...
JFP
2008
75views more  JFP 2008»
15 years 6 months ago
Exploiting reachability and cardinality in higher-order flow analysis
t two complementary improvements for abstract-interpretation-based flow analysis r-order languages: (1) abstract garbage collection and (2) abstract counting.1,2 garbage collecti...
Matthew Might, Olin Shivers
JGAA
2008
97views more  JGAA 2008»
15 years 6 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
CPC
2007
64views more  CPC 2007»
15 years 6 months ago
Sampling Regular Graphs and a Peer-to-Peer Network
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...