403 search results - page 38 / 81 » Variable ranges in linear constraints |
AAAI
1996
13 years 9 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
ATAL
2006
Springer
14 years 7 days ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
CSCLP
2008
Springer
13 years 10 months ago
2008
Springer
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
ISSS
1999
IEEE
14 years 23 days ago
1999
IEEE
Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine t...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Modern networks are highly variable and, as a result, source coders are commonly used under conditions that they were not designed for. We address this problem with a source-codin...