Sciweavers

4860 search results - page 275 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
96
Voted
ICDCS
2007
IEEE
15 years 7 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
77
Voted
IJFCS
2007
80views more  IJFCS 2007»
15 years 18 days ago
Bisimulation Minimization of Tree Automata
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka...
116
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
15 years 18 days ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SPAA
2010
ACM
15 years 5 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha