420 search results - page 5 / 84 » Some Algorithmic Problems in Polytope Theory |
108
click to vote
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 5 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
100
click to vote
AIPS
2006
15 years 1 months ago
2006
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
100
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
CCO
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
ICFCA
2007
Springer
15 years 6 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...