566 search results - page 50 / 114 » Adaptive Online Program Analysis |
156
Voted
JMLR
2012
13 years 5 months ago
2012
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
165
click to vote
VL
2010
IEEE
15 years 26 days ago
2010
IEEE
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
99
Voted
SASO
2009
IEEE
15 years 9 months ago
2009
IEEE
—We examine the use of teleological metareasoning for self-adaptation in game-playing software agents. The goal of our work is to develop an interactive environment in which the ...
110
click to vote
AIIDE
2009
15 years 3 months ago
2009
We examine the problem of self-adaptation in game-playing agents as the game requirements evolve incrementally. The goal of our current work is to develop an interactive environme...
109
click to vote
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...