2412 search results - page 137 / 483 » Which Problems Have Strongly Exponential Complexity |
140
Voted
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
115
click to vote
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
The problem of characterizing lower bounds on data-rates needed for closed loop stability has been solved in a variety of settings. However, the available results lead to coding s...
121
Voted
RECOMB
2007
Springer
16 years 3 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
123
click to vote
ETFA
2005
IEEE
15 years 9 months ago
2005
IEEE
This article covers research work about unmanned helicopters that is being developed by the Portuguese SME IntRoSys, S.A. in the context of a generic project targeting the develop...
150
Voted
SASO
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Unstructured peer-to-peer networks can be extremely flexible, but, because of size, complexity, and high variability in peers’ capacity and reliability, it is a conti...