Sciweavers

88 search results - page 16 / 18
» Cycle Covering
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 7 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
TAMODIA
2007
13 years 7 months ago
Exploring Usability Needs by Human-Computer Interaction Patterns
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...
Markus Specker, Ina Wentzlaff
DAC
2008
ACM
14 years 6 months ago
ADAM: run-time agent-based distributed application mapping for on-chip communication
Design-time decisions can often only cover certain scenarios and fail in efficiency when hard-to-predict system scenarios occur. This drives the development of run-time adaptive s...
Jörg Henkel, Mohammad Abdullah Al Faruque, Ru...
SIGSOFT
2003
ACM
14 years 6 months ago
Deadline analysis of interrupt-driven software
Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others)....
Dennis Brylow, Jens Palsberg
SIGMOD
2006
ACM
208views Database» more  SIGMOD 2006»
14 years 6 months ago
Data management for a smart earth: the Swiss NCCR-MICS initiative
The Swiss National Competence Center for Research in mobile Information and Communication Systems (NCCR-MICS or MICS) is one of several research initiatives sponsored by the Swiss...
Karl Aberer, Gustavo Alonso, Donald Kossmann