Filters








97,341 Hits in 3.8 sec

Learning With Mixed Hard/Soft Pointwise Constraints

Giorgio Gnecco, Marco Gori, Stefano Melacci, Marcello Sanguineti
2015 IEEE Transactions on Neural Networks and Learning Systems  
The general theory is applied to derive the representation of the optimal solution to the problem of learning from hard linear pointwise constraints combined with soft pointwise constraints induced by  ...  Index Terms-Constrained variational calculus, hard and soft constraints, parsimony principle, representer theorems, support constraint machines (SCMs), support constraints. 2162-237X  ...  of mixed hard/soft pointwise constraints.  ... 
doi:10.1109/tnnls.2014.2361866 pmid:25389245 fatcat:fohrwhtg6ndh3dcjkbcbqhrd24

Compromise Matching in P2P e-Marketplaces: Concept, Algorithm and Use Case [chapter]

Manish Joshi, Virendrakumar C. Bhavsar, Harold Boley
2011 Lecture Notes in Computer Science  
A compromise match is called for when either one or both constraints within a pair are soft and moreover their values do not match exactly.  ...  In order to determine the degree of matching between two profiles, corresponding pairs of constraints are compared and aggregated to the overall similarity between the two profiles.  ...  Hard and Soft constraints determine whether a participant can proceed with a match even if the condition value described by his/her constraint is not satisfied by the value of the corresponding constraint  ... 
doi:10.1007/978-3-642-25725-4_34 fatcat:qc67qi46drbp3hbipfzg5yvxla

A knowledge representation model for matchmaking systems in e-marketplaces

Manish Joshi, Virendra Bhavsar, Harold Boley
2009 Proceedings of the 11th International Conference on Electronic Commerce - ICEC '09  
We propose a new knowledge representation (KR) model for Webbased matchmaking systems that can represent these constraints.  ...  We formalize the multifaceted expectations and interests of participants as 'constraints' in those profiles. We identify and explicitly define the relevant types of constraints.  ...  ACKNOWLEDGEMENT This work was partially supported by an ACEnet post-doctoral fellowship and an NSERC Grant of Virendra Bhavsar.  ... 
doi:10.1145/1593254.1593314 dblp:conf/ACMicec/JoshiBB09 fatcat:gxv5aqfl7fdktoppr5qugxopyq

Including Soft Global Constraints in DCOPs [chapter]

Christian Bessiere, Patricia Gutierrez, Pedro Meseguer
2012 Lecture Notes in Computer Science  
We extend the distributed search algorithm BnB-ADOPT + to support these representations of global constraints.  ...  In addition, we explore the relation of global constraints with soft local consistency in DCOPs, in particular for the generalized soft arc consistency (GAC) level.  ...  A soft global constraint C is a class of soft constraints whose arity is not fixed. Constraints with different arities can be defined by the same class.  ... 
doi:10.1007/978-3-642-33558-7_15 fatcat:brnp2pe4fvenpoadcu44bhcxnm

Foundations of Support Constraint Machines

Giorgio Gnecco, Marco Gori, Stefano Melacci, Marcello Sanguineti
2015 Neural Computation  
by different linguistic formalisms, can be translated into the unified notion of constraint for defining the hypothesis set.  ...  We show that regardless of the kind of constraints, the optimal body of the agent is a support constraint machine (SCM) based on representer theorems that extend classical results for kernel machines and  ...  the University of Siena.  ... 
doi:10.1162/neco_a_00686 pmid:25380338 fatcat:pk53wj7p4rbhzd75z5mmmaqcw4

Image Space Potential Fields: Constant Size Environment Representation for Vision-based Subsumption Control Architectures [article]

Jeffrey Kane Johnson
2017 arXiv   pre-print
The presented representation is intended to form the basis of a vision-based subsumption control architecture.  ...  This technical report presents an environment representation for use in vision-based navigation.  ...  Representing Hard & Soft Constraints In potential field representations the distinction between hard and soft constraints can be made in terms of the limiting value of the field as the robot approaches  ... 
arXiv:1709.09662v1 fatcat:vaxmhfpvffgfpfwbrnqqz3klzm

Opaque Allomorphy in OT: Candidate Chains vs. Derivational Optimality Theory

Paweł Rydzewski
2010 Poznan Studies in Contemporary Linguistics  
This article investigates the opacity in allomorphic processes in the masculine nominative plural of Polish nouns. It is shown that the discussed cases of allomorphy are opaque.  ...  Next, the problem is reanalyzed within the theory of candidate chains in order to determine whether the theory is capable of providing a non-derivational account.  ...  hard [ts] but soft [š'].  ... 
doi:10.2478/v10010-010-0024-4 fatcat:5vrxslq3rvh63pzz3fyonhgjme

Manipulation planning with soft task constraints

Tobias Kunz, Mike Stilman
2012 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems  
This paper introduces the necessary algorithms for handling such constraints, including projection methods and useful representations of everyday constraints.  ...  We present a randomized configuration space planner that enforces soft workspace task constraints. A soft task constraint allows an interval of feasible values while favoring a given exact value.  ...  ACKNOWLEDGEMENTS This work is supported by Toyota Motor Engineering & Manufacturing North America (TEMA).  ... 
doi:10.1109/iros.2012.6386134 dblp:conf/iros/KunzS12 fatcat:d64sala6xjck3o4evtkuncrn2u

VIZSolution: An Interface Tool to Solve Real-world Examination Timetabling Problem

J. Joshua Thomas, Ahamad Tajudin Khader, Bahari Belaton, Amy Leow
2010 International Journal of Advancements in Computing Technology  
NP-Hard problems are hard to solve, it requires considerable computational power to generate solutions. The objective is to achieve better solution in less time.  ...  The constraints are either hard or soft. The former must be satisfied in order to come up with a feasible timetable while satisfying the soft constraints is desired by not essential.  ...  A timetable which satisfies all of the hard constraints is usually said to be feasible.  Soft Constraints are desirable but are not absolutely critical.  ... 
doi:10.4156/ijact.vol2.issue5.9 fatcat:kyc5cbsojnc45ph7d7hjyqfnz4

Helicity Constraints To Soft Factor Of All Spin [article]

Andriniaina Narindra Rasoanaivo
2020 arXiv   pre-print
In this note we derive non-perturbative constraints for soft operators in order to preserve the helicities of scatteringamplitudes in a soft limit.  ...  We also show that the resolution of such constraints generates a master formula for theanalytic expression of the single soft factor of any given spin and helicity.  ...  In the first part, we derive such constraints by considering the action of soft operators in such a way amplitude's helicity constraints are preserved.  ... 
arXiv:2002.02120v1 fatcat:ukvgw5atmjdf3m5wucigvzl2i4

Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem [article]

Patrick Kenekayoro, Godswill Zipamone
2016 arXiv   pre-print
The ant system performs better than some published approaches, however results obtained are not as good as those obtained by the best published approaches.  ...  The ant system was able to find feasible solutions in all instances of the dataset and close to optimal solutions in some instances.  ...  defined the detailed mathematical model of the curriculum based UCTP with the hard and soft constraint violations for the track 2 of the ITC 2007 dataset.  ... 
arXiv:1602.04933v1 fatcat:lnsjjr4hazeazlexwabkraz7ae

An Application of Genetic Algorithm for University Course Timetabling Problem

Sanjay R., Rajan S.
2016 International Journal of Applied Information Systems  
Timetabling problem is a process of assigning given set of events and resources to the limited space and time under hard constraints which are rigidly enforced and soft constraints which are satisfied  ...  At first, a model of problem to be solved is defined. Then, the genetic representation is determined and a fitness function is established according to the constraints.  ...  Figure 1 : 1 Schematic chromosome representation of a class timetable added to a hash map Where p (j) -Penalty cost of soft constraint j on T. V (j) -Number of violations of Soft constraint j.  ... 
doi:10.5120/ijais2016451590 fatcat:rqgywpkye5dqzlbs2nc732j3he

Timetable Scheduling System using Genetic Algorithm for School of Computing (tsuGA)

Hazinah Kutty Mammi, Lim Ying Ying
2021 International Journal of Innovative Computing  
Current timetable scheduling system in School of Computing(SC), Universiti Teknologi Malaysia(UTM) is done manually which consumes time and human effort.  ...  Introduction of GA helps in generating a timetable automatically based on information such as rooms, subjects, lecturers, student group and timeslot.  ...  Furthermore, GA can be improved by redefining hard constraints and soft constraints with more details.  ... 
doi:10.11113/ijic.v11n2.342 fatcat:qk3mef3wn5cyhitjw2kaurzvxe

Global Constraints in Distributed Constraint Satisfaction and Optimization

C. Bessiere, I. Brito, P. Gutierrez, P. Meseguer
2013 Computer journal  
We explore the relation of global constraints with local consistency (both in the hard and soft cases), in particular for generalized arc consistency (GAC).  ...  This is ensured by a quaternary constraint on id[i], type[i], capacity[i] and price[i], for all i in 1..K s .  ...  The work of Ismel Brito, Patricia Gutierrez and Pedro Meseguer has been partially supported by the Spanish project TIN2009-13591-C02-02 and Generalitat de Catalunya 2009-SGR-1434.  ... 
doi:10.1093/comjnl/bxt088 fatcat:wtmfo7fxzfhi7k7rsidwqfyrhq

Configuring Software Product Line Feature Models Based on Stakeholders' Soft and Hard Requirements [chapter]

Ebrahim Bagheri, Tommaso Di Noia, Azzurra Ragone, Dragan Gasevic
2010 Lecture Notes in Computer Science  
Furthermore, we formalize the representation of soft constraints in fuzzy P(N ) and explain how semi-automated feature model configuration is performed.  ...  Most feature model configuration processes neglect the need to have a holistic approach towards the integration and satisfaction of the stakeholder's soft and hard constraints, and the applicationdomain  ...  These kinds of requests are called the soft constraints or preferences. In this paper, Stakeholders' hard and soft constraints are represented by SR h , and SR s , respectively.  ... 
doi:10.1007/978-3-642-15579-6_2 fatcat:jmjix4jpprgbbdz675gjxxnunu
« Previous Showing results 1 — 15 out of 97,341 results