3250 search results - page 364 / 650 » An Algorithm to Solve a Linear Program |
203
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
159
click to vote
MP
2010
15 years 1 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
204
click to vote
TROB
2010
15 years 5 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
173
click to vote
PLDI
2004
ACM
16 years 2 days ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
323
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...