1568 search results - page 207 / 314 » The problem of examination questions in algorithmics |
179
click to vote
ICRA
2007
IEEE
16 years 21 days ago
2007
IEEE
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
145
click to vote
DATE
2005
IEEE
16 years 15 hour ago
2005
IEEE
The advent of sensor networks presents untapped opportunities for synthesis. We examine the problem of synthesis of behavioral specifications into networks of programmable sensor ...
174
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-mo...
187
click to vote
LCPC
1999
Springer
15 years 10 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
185
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...