1568 search results - page 167 / 314 » The problem of examination questions in algorithmics |
172
click to vote
AIPS
2007
15 years 8 months ago
2007
A great deal of research has addressed the problem of generating optimal plans, but these plans are of limited use in circumstances where noisy sensors, unanticipated exogenous ac...
168
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
161
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Web of Data is increasingly becoming an important infrastructure for such diverse sectors as entertainment, government, ecommerce and science. As a result, the robust...
183
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...