Sciweavers

942 search results - page 109 / 189
» Distance Constraint Satisfaction Problems
Sort
View
68
Voted
EOR
2007
174views more  EOR 2007»
14 years 10 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
100
Voted
ACL
2009
14 years 8 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
ICMLA
2009
14 years 8 months ago
Mahalanobis Distance Based Non-negative Sparse Representation for Face Recognition
Sparse representation for machine learning has been exploited in past years. Several sparse representation based classification algorithms have been developed for some application...
Yangfeng Ji, Tong Lin, Hongbin Zha
AAAI
2000
14 years 11 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
ICALT
2008
IEEE
15 years 4 months ago
A Framework for Semantic Group Formation
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
Asma Ounnas, Hugh C. Davis, David E. Millard