4313 search results - page 754 / 863 » Using time travel to diagnose computer problems |
174
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
127
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
165
Voted
CCS
2007
ACM
15 years 7 months ago
2007
ACM
Given a history of packet transmissions and an excerpt of a possible packet payload, the payload attribution problem requires the identification of sources, destinations and the t...
135
Voted
FLAIRS
2008
15 years 6 months ago
2008
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
132
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...