Sciweavers

293 search results - page 36 / 59
» Optimal Integer Alphabetic Trees in Linear Time
Sort
View
DATE
2007
IEEE
142views Hardware» more  DATE 2007»
14 years 2 months ago
Optimizing instruction-set extensible processors under data bandwidth constraints
We present a methodology for generating optimized architectures for data bandwidth constrained extensible processors. We describe a scalable Integer Linear Programming (ILP) formu...
Kubilay Atasu, Robert G. Dimond, Oskar Mencer, Way...
JSAT
2006
88views more  JSAT 2006»
13 years 7 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
PDP
2011
IEEE
12 years 11 months ago
Transport Optimization in Peer-to-Peer Networks
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
Konstantin Miller, Adam Wolisz
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 5 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
MIG
2010
Springer
13 years 6 months ago
Path Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...