Sciweavers

1725 search results - page 19 / 345
» Relaxed genetic programming
Sort
View
NIPS
2007
13 years 10 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CC
2010
Springer
172views System Software» more  CC 2010»
14 years 3 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
EOR
2007
78views more  EOR 2007»
13 years 8 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
AOSD
2010
ACM
14 years 3 months ago
Type relaxed weaving
Statically typed aspect-oriented programming languages restrict application of around advice only to the join points that have conforming types. Though the restriction guarantees ...
Hidehiko Masuhara, Atsushi Igarashi, Manabu Toyama