<--- Back to Details
First PageDocument Content
Software engineering / Computer programming / Constraint programming / Enumerated type / Type theory / Constraint satisfaction problem / Generator / Backtracking / Data structure
Date: 2016-03-05 17:06:25
Software engineering
Computer programming
Constraint programming
Enumerated type
Type theory
Constraint satisfaction problem
Generator
Backtracking
Data structure

Programming with Enumerators: Constructive Approach to Challenge the Status Quo in Automated Data Structure Generation Ivan Kuraj CSAIL, MIT, USA

Add to Reading List

Source URL: tinytocs.ece.utexas.edu

Download Document from Source Website

File Size: 86,30 KB

Share Document on Facebook

Similar Documents

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

DocID: 1xUdh - View Document

PDF Document

DocID: 1xSrV - View Document

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

DocID: 1vleR - View Document

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email:  September 1995

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995

DocID: 1v7SC - View Document

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

DocID: 1v72L - View Document