Sciweavers

4744 search results - page 778 / 949
» Connected Computing
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 6 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ENTCS
2008
138views more  ENTCS 2008»
15 years 6 months ago
Compositionality of Statically Scheduled IP
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...
Julien Boucaron, Jean-Vivien Millo
ENTCS
2008
96views more  ENTCS 2008»
15 years 6 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
CCR
2006
110views more  CCR 2006»
15 years 6 months ago
On the feasibility of commercial, legal P2P content distribution
A spirited panel was recently held at the 10th International Web Caching and Content Distribution workshop on the future of P2P in content distribution [1]. After more than ten ye...
Pablo Rodriguez, See-Mong Tan, Christos Gkantsidis
CN
2006
82views more  CN 2006»
15 years 6 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue