7785 search results - page 415 / 1557 » The Concept of Dynamic Analysis |
202
click to vote
STOC
2003
ACM
16 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...
169
click to vote
CISIS
2009
IEEE
16 years 1 months ago
2009
IEEE
Structured, spatial-temporal data arises in many applications areas such as transportation, sensor networks or mobile services. Peer to peer networks are the natural choice for th...
179
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionalit...
201
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— To realize the harmonious cooperation with the operator, the man-machine cooperative system must be designed so as to accommodate with the characteristics of the operator’s s...
183
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...