Sciweavers

3886 search results - page 412 / 778
» Toward Recovery-Oriented Computing
Sort
View
ICFP
2003
ACM
16 years 6 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
176
Voted
VLSID
2007
IEEE
131views VLSI» more  VLSID 2007»
16 years 1 months ago
A Placement Methodology for Robust Clocking
As the VLSI technology scales towards the nanometer regime, circuit performance is increasingly affected by variations. These variations need to be considered at an early stage in...
Ganesh Venkataraman, Jiang Hu
BROADNETS
2006
IEEE
16 years 25 days ago
A Secure Programming Paradigm for Network Virtualization
—The central paradigm of today’s successful Internet is to keep the network core simple and move complexity towards the network end points. Unfortunately, this very paradigm li...
Ana Milanova, Sonia Fahmy, David Musser, Büle...
JSSPP
2005
Springer
16 years 8 days ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan
BSDCON
2003
15 years 8 months ago
ULE: A Modern Scheduler for FreeBSD
The existing thread scheduler in FreeBSD was well suited towards the computing environment that it was developed in. As the priorities and hardware targets of the project have cha...
Jeff Roberson