1568 search results - page 100 / 314 » The problem of examination questions in algorithmics |
147
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
144
click to vote
COLING
1996
15 years 5 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
128
click to vote
ICGA
1993
15 years 5 months ago
1993
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
168
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
148
click to vote
UAI
2003
15 years 5 months ago
2003
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...