Sciweavers

5863 search results - page 173 / 1173
» Calculating Functional Programs
Sort
View
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
15 years 9 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
FSTTCS
2008
Springer
15 years 7 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
ICRA
2009
IEEE
207views Robotics» more  ICRA 2009»
15 years 4 months ago
Bayesian network-based behavior control for skilligent robots
A Skilligent robot must be able to learn skills autonomously to accomplish a task. "Skilligence" is the capacity of the robot to control behaviors reasonably, based on th...
Sang Hyoung Lee, Il Hong Suh
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 25 days ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
WCFLP
2005
ACM
15 years 11 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal