1568 search results - page 114 / 314 » The problem of examination questions in algorithmics |
146
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
112
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequencyflat Gaussian...
124
click to vote
CORR
1998
Springer
15 years 4 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
165
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
146
click to vote
ISCI
2008
15 years 4 months ago
2008
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...