Sciweavers

2254 search results - page 276 / 451
» Computing the minimal covering set
Sort
View
VLSID
2002
IEEE
135views VLSI» more  VLSID 2002»
16 years 7 months ago
An Efficient Algorithm for Low Power Pass Transistor Logic Synthesis
In this paper, we address the problem of power dissipation minimization in combinational circuits implemented using pass transistor logic (PTL). We transform the problem of power ...
Rupesh S. Shelar, Sachin S. Sapatnekar
P2P
2008
IEEE
120views Communications» more  P2P 2008»
16 years 29 days ago
Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks
Trees are fundamental structures for data dissemination in large-scale network scenarios. However, their inherent fragility has led researchers to rely on more redundant mesh topo...
Davide Frey, Amy L. Murphy
AIMSA
2008
Springer
16 years 28 days ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
ICA3PP
2007
Springer
16 years 22 days ago
An Efficient Source Peer Selection Algorithm in Hybrid P2P File Sharing Systems
We propose a source peer selection algorithm which efficiently chooses peers as sources from a set of peers having the requested file in a hybrid P2P file sharing system. Our propo...
Jingyuan Li, Weijia Jia, Liusheng Huang, Mingjun X...
ICALP
2007
Springer
16 years 22 days ago
Continuous Capacities on Continuous State Spaces
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
Jean Goubault-Larrecq