Sciweavers

9842 search results - page 1959 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
PLDI
2010
ACM
14 years 16 days ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
PLDI
2010
ACM
14 years 16 days ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
GLVLSI
2002
IEEE
108views VLSI» more  GLVLSI 2002»
14 years 13 days ago
Protected IP-core test generation
Design simplification is becoming necessary to respect the target time-to-market of SoCs, and this goal can be obtained by using predesigned IP-cores. However, their correct inte...
Alessandro Fin, Franco Fummi
HICSS
2002
IEEE
148views Biometrics» more  HICSS 2002»
14 years 13 days ago
Barriers to a Wide-Area Trusted Network Early Warning System for Electric Power Disturbances
It is apparent that perturbations of the North American electric power grid follow the patterns and characteristics of Self Organized Critical (SOC) systems. Published studies sho...
Paul W. Oman, Jeff Roberts
HICSS
2002
IEEE
144views Biometrics» more  HICSS 2002»
14 years 13 days ago
Managing Long Term Communications: Conversation and Contact Management
Contact management is an important part of everyday work. People exchange business cards to try to enter each other’s contact lists. Local businesses provide refrigerator magnet...
Steve Whittaker, Quentin Jones, Loren G. Terveen
« Prev « First page 1959 / 1969 Last » Next »