10493 search results - page 29 / 2099 » Dynamic Word Problems |
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
MP
2006
13 years 7 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
RAS
2008
13 years 7 months ago
2008
In this paper we present the robot programming and planning language Readylog, a Golog dialect which was developed to support the decision making of robots acting in dynamic real-...
AUTOMATICA
2010
13 years 7 months ago
2010
Based on the linear expression of the dynamics of Boolean networks, the coordinate transformation of Boolean variables is defined. It follows that the state space coordinate trans...
MP
2011
13 years 2 months ago
2011
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...