4313 search results - page 53 / 863 » Using time travel to diagnose computer problems |
114
click to vote
FUN
2010
Springer
15 years 6 months ago
2010
Springer
In the classic Josephus problem, elements 1, 2, . . . , n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consi...
108
click to vote
AAAI
2000
15 years 3 months ago
2000
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
FOCS
1997
IEEE
15 years 6 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
116
click to vote
MP
2006
15 years 1 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
KDD
1998
ACM
15 years 6 months ago
1998
ACM
In this paper, weexplore the use of machinelearning and data mining to improvethe prediction of travel times in an automobile. Weconsider two formulations of this problem, one tha...