711 search results - page 107 / 143 » Amalgams of Constraint Satisfaction Problems |
154
click to vote
CONSTRAINTS
2007
15 years 4 months ago
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 ...
140
click to vote
AI
2000
Springer
15 years 4 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
130
click to vote
AIPS
2006
15 years 5 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
145
click to vote
AISC
2008
Springer
15 years 6 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
144
click to vote
FLAIRS
2004
15 years 5 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...