Sciweavers

11328 search results - page 334 / 2266
» Timed Branching Processes
Sort
View
FSTTCS
2007
Springer
15 years 11 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
145
Voted
HPCC
2007
Springer
15 years 11 months ago
Software Pipelining for Packet Filters
Packet filters play an essential role in traffic management and security management on the Internet. In order to create software-based packet filters that are fast enough to work...
Yoshiyuki Yamashita, Masato Tsuru
123
Voted
ASPLOS
2006
ACM
15 years 10 months ago
A performance counter architecture for computing accurate CPI components
Cycles per Instruction (CPI) stacks break down processor execution time into a baseline CPI plus a number of miss event CPI components. CPI breakdowns can be very helpful in gaini...
Stijn Eyerman, Lieven Eeckhout, Tejas Karkhanis, J...
CRV
2005
IEEE
191views Robotics» more  CRV 2005»
15 years 10 months ago
Automated Behavioral Phenotype Detection and Analysis Using Color-Based Motion Tracking
The problem of elucidating the functional significance of genes is a key challenge of modern science. Solving this problem can lead to fundamental advancements across multiple are...
Alan Shimoide, Ilmi Yoon, Megumi Fuse, Holly C. Be...
VMCAI
2005
Springer
15 years 10 months ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...