1568 search results - page 104 / 314 » The problem of examination questions in algorithmics |
136
click to vote
NIPS
2008
15 years 5 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...
157
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
155
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
154
click to vote
JCO
2010
15 years 2 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
128
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...