7150 search results - page 1092 / 1430 » An Approximation Algorithm for Approximation Rank |
184
click to vote
ICGI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
207
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
209
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
238
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
189
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...