4403 search results - page 50 / 881 » Galois Theory of Algorithms |
184
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
143
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
190
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
168
Voted
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
206
click to vote
TSP
2008
15 years 6 months ago
2008
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...