16504 search results - page 4 / 3301 » New Problems, New Solutions |
IJCAI
2003
15 years 1 months ago
2003
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
NOMS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Flow-level traffic measurement is required for a wide range of applications including accounting, network planning and security management. A key design challenge is how to gr...
101
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
118
click to vote
ECTEL
2006
Springer
15 years 4 months ago
2006
Springer
More and more CoPs have chosen virtual environments and services to support their activities. However, recent research has underlined several problems: the lack of adequate scaffol...
TASE
2008
IEEE
15 years 5 days ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...