2109 search results - page 37 / 422 » Solving Necklace Constraint Problems |
139
click to vote
ATMOS
2007
15 years 6 months ago
2007
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
120
click to vote
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
The draft revision of the IEEE Standard for FloatingPoint Arithmetic (IEEE P754) includes a definition for decimal floating-point (FP) in addition to the widely used binary FP s...
141
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
160
click to vote
PRICAI
1998
Springer
15 years 8 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
118
click to vote
FLAIRS
2003
15 years 5 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...