Sciweavers

1569 search results - page 81 / 314
» Programming contest strategy
Sort
View
ICCS
2009
Springer
14 years 5 months ago
Hiding Communication Latency with Non-SPMD, Graph-Based Execution
Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present...
Jacob Sorensen, Scott B. Baden
PPDP
1999
Springer
14 years 3 months ago
Constraint Programming in OPL
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
Pascal Van Hentenryck, Laurent Michel, Laurent Per...
LMO
2000
14 years 15 days ago
A Metamodel for Concurrent, Object-based Programming
The development of flexible and reusable concurrent object-oriented programming ions has suffered from the inherent problem that reusability and extensibility is limited due to pos...
Jean-Guy Schneider, Markus Lumpe
COR
2006
98views more  COR 2006»
13 years 11 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
IFIP
2004
Springer
14 years 4 months ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch