15033 search results - page 307 / 3007 » Complexity Theory and Algorithms |
141
click to vote
TON
2002
15 years 4 months ago
2002
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
140
click to vote
TPDS
2010
15 years 3 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
159
click to vote
BIOCOMP
2009
15 years 2 months ago
2009
- Identification and annotation of all the functional elements in the genome, including genes and regulatory sequences, is a fundamental challenge in genomics and computational bio...
193
click to vote
NFM
2011
15 years 1 days ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
167
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...