Sciweavers

1181 search results - page 28 / 237
» constraints 2004
Sort
View
AICOM
2004
92views more  AICOM 2004»
13 years 8 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
14 years 2 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann
AAAI
2004
13 years 10 months ago
An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
Tristan B. Smith, John M. Pyle
FLAIRS
2004
13 years 10 months ago
Knowledge-Based Constraint Satisfaction for Spatial Reasoning
This linguistically motivated work addresses issues in reasoning intelligently over spatial descriptions of simple, static scenes to produce plausible graphical interpretations. I...
Dan Tappan
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 8 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer