1452 search results - page 73 / 291 » Algorithmic Analysis of Array-Accessing Programs |
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, a revised form of Implicit Context Representation Cartesian Genetic Programming is used in the development of a diagnostic tool for the assessment of patients wi...
124
click to vote
ISAAC
2010
Springer
15 years 1 days ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
111
click to vote
ASPDAC
1999
ACM
15 years 6 months ago
1999
ACM
Certain manufacturing steps in very deep submicron VLSI involve chemical-mechanical polishing CMP which has varying e ects on device and interconnect features, depending on loca...
110
click to vote
AI
2000
Springer
15 years 1 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
109
click to vote
ICSE
2007
IEEE-ACM
16 years 2 months ago
2007
IEEE-ACM
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...