Sciweavers

13841 search results - page 359 / 2769
» Algorithms and Constraint Programming
Sort
View
JFP
2002
89views more  JFP 2002»
15 years 6 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton
173
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 8 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
APSEC
2005
IEEE
16 years 13 days ago
Call-Ordering Constraints
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
Nam Tran, David Abramson, Christine Mingins
CP
2005
Springer
16 years 10 days ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
CAV
2003
Springer
108views Hardware» more  CAV 2003»
16 years 1 days ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...