427 search results - page 35 / 86 » A Subexponential Bound for Linear Programming |
DISOPT
2008
13 years 7 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
AAAI
2010
13 years 9 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
CP
2001
Springer
14 years 6 days ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
SYNASC
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...