1568 search results - page 35 / 314 » The problem of examination questions in algorithmics |
WWW
2004
ACM
15 years 10 months ago
2004
ACM
The enormity and rapid growth of the web-graph forces quantities such as its pagerank to be computed under missing information consisting of outlinks of pages that have not yet be...
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
EOR
2007
14 years 10 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
AB
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...