1568 search results - page 174 / 314 » The problem of examination questions in algorithmics |
158
click to vote
ALGOSENSORS
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
165
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We revisit a class of multimodal function optimizations using evolutionary algorithms reformulated into a multiobjective framework where previous implementations have nee...
176
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
194
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
166
click to vote
ICASSP
2008
IEEE
16 years 25 days ago
2008
IEEE
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...