Sciweavers

1452 search results - page 73 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
CEC
2009
IEEE
14 years 5 months ago
Implicit Context Representation Cartesian Genetic Programming for the assessment of visuo-spatial ability
— 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...
Stephen L. Smith, Michael A. Lones
ISAAC
2010
Springer
240views Algorithms» more  ISAAC 2010»
13 years 9 months ago
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity
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...
Hugo Férée, Emmanuel Hainry, Mathieu...
ASPDAC
1999
ACM
107views Hardware» more  ASPDAC 1999»
14 years 3 months ago
New Multilevel and Hierarchical Algorithms for Layout Density Control
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...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Alex...
AI
2000
Springer
13 years 11 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
ICSE
2007
IEEE-ACM
14 years 11 months ago
Kato: A Program Slicing Tool for Declarative Specifications
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...
Engin Uzuncaova, Sarfraz Khurshid