Sciweavers

2124 search results - page 140 / 425
» Aggregating time partitions
Sort
View
132
Voted
DATE
1999
IEEE
138views Hardware» more  DATE 1999»
15 years 8 months ago
Codex-dp: Co-design of Communicating Systems Using Dynamic Programming
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
Jui-Ming Chang, Massoud Pedram
COR
2008
102views more  COR 2008»
15 years 3 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
141
Voted
COLOGNETWENTE
2010
15 years 2 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
115
Voted
NETGAMES
2003
ACM
15 years 9 months ago
Modeling player session times of on-line games
One of the most important aspects in determining the global traffic characteristics of on-line games is to model the traffic behavior of the client. While modeling the client ON-O...
Francis Chang, Wu-chang Feng
ICWN
2008
15 years 5 months ago
Coverage Efficient Clustering Method Based on Time Delay for Wireless Sensor Networks
Energy efficient operations are essential to increase the lifetime of wireless sensor network. A clustering-based protocol is one approach that reduces energy by a data aggregation...
Ji Gong, Hyuntae Kim, Gihwan Cho