Sciweavers

9626 search results - page 341 / 1926
» Invariant Based Programming
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler
ANOR
2002
128views more  ANOR 2002»
15 years 6 months ago
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis...
SIGCSE
2010
ACM
121views Education» more  SIGCSE 2010»
16 years 1 months ago
Using strategies for assessment of programming exercises
Programming exercise assessment tools alleviate the task of teachers, and increase consistency of markings. Many programming exercise assessment tools are based on testing. A test...
Alex Gerdes, Johan Jeuring, Bastiaan Heeren
WCFLP
2005
ACM
16 years 6 days 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
ICLP
2010
Springer
15 years 10 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...