1568 search results - page 43 / 314 » The problem of examination questions in algorithmics |
88
Voted
COCOON
2007
Springer
15 years 2 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
WABI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
102
click to vote
OL
2007
14 years 9 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
TALG
2010
14 years 8 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
AAAI
2004
14 years 11 months ago
2004
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...