Sciweavers

4432 search results - page 393 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 8 months ago
Memory analysis and significance test for agent behaviours
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
DaeEun Kim
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 11 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
TON
2012
13 years 7 months ago
Latency Equalization as a New Network Service Primitive
—Multiparty interactive network applications such as teleconferencing, network gaming, and online trading are gaining popularity. In addition to end-to-end latency bounds, these ...
Minlan Yu, Marina Thottan, Li (Erran) Li
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 9 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
CP
2006
Springer
15 years 8 months ago
Mini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
Emma Rollon, Javier Larrosa