Sciweavers

311 search results - page 18 / 63
» Exploiting Decomposition in Constraint Optimization Problems
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 10 months ago
Minimum cost distributed source coding over a network
— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Aditya Ramamoorthy
SIGECOM
2006
ACM
128views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
Controlling a supply chain agent using value-based decomposition
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
Christopher Kiekintveld, Jason Miller, Patrick R. ...
ICDT
2003
ACM
91views Database» more  ICDT 2003»
14 years 3 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 11 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
SIAMSC
2010
158views more  SIAMSC 2010»
13 years 8 months ago
Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be im...
Michael K. Ng, Pierre Weiss, Xiaoming Yuan