Sciweavers

69 search results - page 12 / 14
» Random Sampling of States in Dynamic Programming
Sort
View
CACM
2008
131views more  CACM 2008»
13 years 7 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
KBSE
2005
IEEE
14 years 1 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
PERVASIVE
2009
Springer
14 years 2 months ago
Methodologies for Continuous Cellular Tower Data Analysis
This paper presents novel methodologies for the analysis of continuous cellular tower data from 215 randomly sampled subjects in a major urban city. We demonstrate the potential of...
Nathan Eagle, John A. Quinn, Aaron Clauset
IJRR
2011
174views more  IJRR 2011»
13 years 2 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
ANOR
2007
73views more  ANOR 2007»
13 years 7 months ago
A sample-path approach to optimal position liquidation
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
Pavlo A. Krokhmal, Stan Uryasev