Sciweavers

2864 search results - page 217 / 573
» Constraint Programming in OPL
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 months ago
Lattice model refinement of protein structures
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
Martin Mann, Alessandro Dal Palù
VL
1994
IEEE
154views Visual Languages» more  VL 1994»
14 years 2 months ago
Stretch-A-Sketch: a Dynamic Diagrammer
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
Mark D. Gross
COR
2006
108views more  COR 2006»
13 years 10 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
RR
2010
Springer
13 years 9 months ago
A Rule-Based Approach to XML Processing and Web Reasoning
Abstract. We illustrate the potential of conditional hedge transformations in Web-related applications on the example of PρLog: an extension of logic programming with advanced rul...
Jorge Coelho, Besik Dundua, Mário Florido, ...
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 10 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard