Sciweavers

14360 search results - page 2848 / 2872
» Time Modeling in MARTE
Sort
View
VLSISP
2002
112views more  VLSISP 2002»
13 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
CCR
2008
85views more  CCR 2008»
13 years 9 months ago
On cycles in AS relationships
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
Xenofontas A. Dimitropoulos, M. Ángeles Ser...
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 9 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
NA
2007
147views more  NA 2007»
13 years 9 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
QUESTA
2007
136views more  QUESTA 2007»
13 years 9 months ago
A resource allocation queueing fairness measure: properties and bounds
Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
Benjamin Avi-Itzhak, Hanoch Levy, David Raz
« Prev « First page 2848 / 2872 Last » Next »