Sciweavers

595 search results - page 108 / 119
» The Graph Programming Language GP
Sort
View
CP
2003
Springer
14 years 2 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 10 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
PAAPP
2006
141views more  PAAPP 2006»
13 years 8 months ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko
CASES
2009
ACM
13 years 6 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
ITS
2004
Springer
130views Multimedia» more  ITS 2004»
14 years 2 months ago
Opening the Door to Non-programmers: Authoring Intelligent Tutor Behavior by Demonstration
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
Kenneth R. Koedinger, Vincent Aleven, Neil T. Heff...