4112 search results - page 151 / 823 » Efficient Algorithms for the Spoonerism Problem |
117
click to vote
AAAI
1994
15 years 5 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
124
Voted
ANOR
2008
15 years 4 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
140
click to vote
EOR
2006
15 years 4 months ago
2006
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
115
click to vote
EOR
2007
15 years 4 months ago
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
125
click to vote
EOR
2002
15 years 4 months ago
2002
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...