261 search results - page 33 / 53 » On Threshold BDDs and the Optimal Variable Ordering Problem |
CP
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
STOC
2005
ACM
14 years 1 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract-We address issues related to efficiency, fairness, endto-end delay minimization and Quality-of-Service in order to enable a flexible access and dynamic mission operation c...
SAGA
2001
Springer
14 years 4 days ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...