10493 search results - page 378 / 2099 » Dynamic Word Problems |
207
Voted
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...
193
click to vote
MLDM
2009
Springer
16 years 2 months ago
2009
Springer
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
200
Voted
CEC
2008
IEEE
16 years 2 months ago
2008
IEEE
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
196
Voted
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...
203
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we propose a bandwidth allocation scheme for networked control systems that have their control loops closed over a geographically distributed network. We first for...