Sciweavers

2398 search results - page 314 / 480
» Constraint Programming and Graph Algorithms
Sort
View
COCOA
2010
Springer
15 years 4 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
ICFP
2006
ACM
16 years 6 months ago
OCaml + XDuce
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
Alain Frisch
175
Voted
ESOP
2007
Springer
15 years 10 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan
182
Voted
ICWL
2004
Springer
15 years 11 months ago
Learning Algorithms with an Electronic Chalkboard over the Web
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...
Margarita Esponda Argüero, Raúl Rojas
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
16 years 21 days ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt