Sciweavers

6456 search results - page 39 / 1292
» Constraint Solving on Terms
Sort
View
CODES
2010
IEEE
14 years 10 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
WSPI
2004
15 years 2 months ago
Grounding Knowledge of Engineering Applications in Systematic Terms
In the main research of internet-computing enabled knowledge management, we use some of the most advanced research scenarios, arguing that we critically need a system approach to q...
Ying Liu 0002, Jin Yu
93
Voted
IDEAL
2003
Springer
15 years 6 months ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
95
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 25 days ago
Model-Driven Constraint Programming
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
Raphaël Chenouard, Laurent Granvilliers, Rica...
118
Voted
ICFP
2008
ACM
16 years 21 days ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy