Sciweavers

1508 search results - page 249 / 302
» Efficient Path Profiling
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 6 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
14 years 5 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
INFOCOM
2009
IEEE
14 years 3 months ago
CFP: Cooperative Fast Protection
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Ta...
VLDB
2007
ACM
128views Database» more  VLDB 2007»
14 years 2 months ago
A genetic approach for random testing of database systems
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleks...
INFOCOM
2006
IEEE
14 years 2 months ago
GMPLS-Based Dynamic Provisioning and Traffic Engineering of High-Capacity Ethernet Circuits in Hybrid Optical/Packet Networks
- Rapid progress in deployment of national and regional optical network infrastructures holds the promise to provide abundant, inexpensive bandwidth to scientific communities. The ...
Xi Yang, Chris Tracy, Jerry Sobieski, Tom Lehman