Sciweavers

391 search results - page 45 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
FROCOS
2000
Springer
13 years 11 months ago
Handling Differential Equations with Constraints for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona
IJCNN
2006
IEEE
14 years 1 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
LPAR
2010
Springer
13 years 6 months ago
A Syntactical Approach to Qualitative Constraint Networks Merging
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
Jean-François Condotta, Souhila Kaci, Pierr...
CVPR
2006
IEEE
14 years 9 months ago
Learning Semantic Patterns with Discriminant Localized Binary Projections
In this paper, we present a novel approach to learning semantic localized patterns with binary projections in a supervised manner. The pursuit of these binary projections is refor...
Shuicheng Yan, Tianqiang Yuan, Xiaoou Tang
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap