4451 search results - page 142 / 891 » On Random Ordering Constraints |
138
click to vote
AAAI
1994
15 years 6 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
160
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
114
Voted
SIAMJO
2008
15 years 4 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
121
Voted
ARITH
2007
IEEE
15 years 11 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...
145
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...