Sciweavers

285 search results - page 31 / 57
» The complexity of soft constraint satisfaction
Sort
View
FLAIRS
2003
15 years 1 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin
RTAS
2010
IEEE
14 years 10 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
15 years 3 months ago
Object Modeling with Guaranteed Fulfillment of Geometric Constraints
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
Da-Chuan Cheng, Xiaoyi Jiang
WETICE
1996
IEEE
15 years 4 months ago
A constraint-based model of coordination in concurrent design projects
Communication and coordination play an important role in achieving concurrency in the design of large complex artifacts. It is also widely accepted that design is constraint orien...
Lokesh Gupta, John F. Chionglo, Mark S. Fox
CSCLP
2008
Springer
15 years 1 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin