569 search results - page 64 / 114 » An Empirical Study of Structural Constraint Solving Techniqu... |
163
click to vote
SC
2004
ACM
15 years 11 months ago
2004
ACM
This work describes a technique for improving network performance in Grid environments that we refer to as “logistics.” We demonstrate that by using storage and cooperative fo...
185
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
180
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
144
click to vote
AAECC
2006
Springer
15 years 10 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
186
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...