Sciweavers

7189 search results - page 29 / 1438
» Connecting Design with Code
Sort
View
SAINT
2008
IEEE
15 years 9 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
ICDCS
2006
IEEE
15 years 9 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
JCT
2010
92views more  JCT 2010»
15 years 1 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
CN
2007
141views more  CN 2007»
15 years 2 months ago
Designing an overload control strategy for secure e-commerce applications
Uncontrolled overload can lead e-commerce applications to considerable revenue losses. For this reason, overload prevention in these applications is a critical issue. In this pape...
Jordi Guitart, David Carrera, Vicenç Beltra...
DATE
2002
IEEE
83views Hardware» more  DATE 2002»
15 years 7 months ago
Memory System Connectivity Exploration
In programmable embedded systems, the memory subsystem represents a major cost, performance and power bottleneck. To optimize the system for such different goals, the designer wou...
Peter Grun, Nikil D. Dutt, Alexandru Nicolau