Sciweavers

1593 search results - page 25 / 319
» A visual programming system for automated problem solving
Sort
View
CPAIOR
2010
Springer
14 years 9 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
15 years 5 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 1 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
APLAS
2003
ACM
15 years 5 months ago
Constraint Functional Logic Programming for Origami Construction
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which desc...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi
ENTCS
2008
116views more  ENTCS 2008»
14 years 11 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...