Sciweavers

4137 search results - page 269 / 828
» On the number of matchings of a tree
Sort
View
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
16 years 10 days ago
Reducing the Forwarding State Requirements of Point-to-Multipoint Trees Using MPLS Multicast
IP multicast was first proposed to improve the performance of applications that require group communications. Still, many years after its initial proposal, IP multicast is not wi...
George Apostolopoulos, Ioana Ciurea
COCOON
2005
Springer
16 years 8 days ago
Min-Energy Voltage Allocation for Tree-Structured Tasks
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
Minming Li, Becky Jie Liu, Frances F. Yao
ICALP
2005
Springer
16 years 8 days ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
16 years 18 hour ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
ECRTS
2002
IEEE
15 years 11 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat