Sciweavers

46 search results - page 8 / 10
» Satisfiability Modulo the Theory of Costs: Foundations and A...
Sort
View
CORR
2010
Springer
184views Education» more  CORR 2010»
13 years 4 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 5 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
ICSE
2001
IEEE-ACM
13 years 9 months ago
Using Transformation Systems for Software Maintenance and Reengineering
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
Ira D. Baxter
DEXA
2005
Springer
176views Database» more  DEXA 2005»
13 years 10 months ago
Control-Based Quality Adaptation in Data Stream Management Systems
Unlike processing snapshot queries in a traditional DBMS, the processing of continuous queries in a data stream management system (DSMS) needs to satisfy quality requirements such ...
Yi-Cheng Tu, Mohamed Hefeeda, Yuni Xia, Sunil Prab...
KBSE
2010
IEEE
13 years 3 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer