4313 search results - page 281 / 863 » Using time travel to diagnose computer problems |
202
click to vote
FLAIRS
2004
15 years 8 months ago
2004
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
210
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
196
click to vote
ECAI
2008
Springer
15 years 9 months ago
2008
Springer
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
188
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
218
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...