178 search results - page 22 / 36 » Solving Disjunctive Constraints for Interactive Graphical Ap... |
CP
2005
Springer
15 years 5 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
122
Voted
AAAI
1994
15 years 1 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
125
click to vote
GRAPHICSINTERFACE
2011
14 years 3 months ago
2011
The classic task of image compositing is complicated by the fact that the source and target images need to be carefully aligned and adjusted. Otherwise, it is not possible to achi...
76
Voted
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
106
click to vote
SIGGRAPH
1995
ACM
15 years 3 months ago
1995
ACM
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...