Sciweavers

407 search results - page 22 / 82
» Optimization of Linear Logic Programs Using Counting Methods
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
INFOCOM
2003
IEEE
14 years 25 days ago
Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
Wanjiun Liao
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
14 years 8 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
AAAI
2006
13 years 9 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance optimization of elastic systems using buffer resizing and buffer insertion
Abstract—Buffer resizing and buffer insertion are two transformation techniques for the performance optimization of elastic systems. Different approaches for each technique have ...
Dmitry Bufistov, Jorge Júlvez, Jordi Cortad...