Sciweavers

16790 search results - page 3093 / 3358
» A Future for Software Engineering
Sort
View
FSTTCS
2009
Springer
16 years 21 days ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
183
Voted
FSTTCS
2009
Springer
16 years 21 days ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
FSTTCS
2009
Springer
16 years 21 days ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
MODELS
2009
Springer
16 years 20 days ago
Domain analysis on an electronic health records system
Electronic Health Records (EHR) have been proposed as a means for managing the technical and organisational complexity that arises in modern healthcare. Different EHR systems are...
Xiaocheng Ge, Richard F. Paige, John A. McDermid
OOPSLA
2009
Springer
16 years 20 days ago
Typestate-oriented programming
Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages ...
Jonathan Aldrich, Joshua Sunshine, Darpan Saini, Z...
« Prev « First page 3093 / 3358 Last » Next »