1568 search results - page 96 / 314 » The problem of examination questions in algorithmics |
159
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
We revisit the problem of incentive-compatible interdomain routing, examining the, quite realistic, special case in which the autonomous systems’ (ASes’) utilities are linear f...
120
click to vote
CCCG
2010
15 years 5 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
134
click to vote
ADBIS
2000
Springer
15 years 8 months ago
2000
Springer
Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web lo...
121
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
120
Voted
KES
1998
Springer
15 years 8 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...