3907 search results - page 392 / 782 » Time, Knowledge, and Choice |
178
click to vote
CP
2004
Springer
16 years 8 days ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
210
click to vote
EGPGV
2004
Springer
16 years 8 days ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
182
click to vote
ITS
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
175
click to vote
CCGRID
2003
IEEE
16 years 5 days ago
2003
IEEE
At least three factors in the existing migrating systems make them less suitable in Grid systems especially when the goal is to improve the response times for individual applicati...
166
click to vote
SPAA
2003
ACM
16 years 4 days ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...