Sciweavers

717 search results - page 67 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
150 views 108 votes 15 years 7 months ago  CPAIOR 2007»
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
106 views 108 votes 15 years 1 months ago  AAI 2006»
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
116 views 109 votes 15 years 1 months ago  BMCBI 2010»
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
258 views 162 votes 15 years 3 months ago  CSCLP 2008»
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...
72 views 81 votes 15 years 8 months ago  SAC 2009»
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
129 views 112 votes 15 years 5 months ago  AI 1998»
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
103 views 126 votes 15 years 2 months ago  DATESO 2007»
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
181 views 139 votes 14 years 1 months ago  CP 2011»
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
100 views 119 votes 15 years 1 months ago  CONSTRAINTS 2007»
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
111 views 142 votes 15 years 3 months ago  ECAI 2008»
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...