129 search results - page 10 / 26 » Uniform deterministic dictionaries |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ICRA
2003
IEEE
14 years 24 days ago
2003
IEEE
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
ALDT
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
AAAI
2008
13 years 9 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...