Sciweavers

4438 search results - page 492 / 888
» The Case for Collaborative Programming
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Robust Formulations for Handling Uncertainty in Kernel Matrices
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...
Sahely Bhadra, Sourangshu Bhattacharya, Chiranjib ...
AICOM
2010
127views more  AICOM 2010»
15 years 7 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
JCP
2008
139views more  JCP 2008»
15 years 6 months ago
Research on Risk Evaluation in Supply Chain Based on Grey Relational Method
Supply chain risk evaluation is a multi-criteria decision making problem under fuzzy environments. To tackle the problem, this paper firstly identifies and discusses some of the im...
Peide Liu, Tongjuan Wang
ENTCS
2007
109views more  ENTCS 2007»
15 years 6 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
ENTCS
2007
82views more  ENTCS 2007»
15 years 6 months ago
On the Computational Representation of Classical Logical Connectives
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
Jayshan Raghunandan, Alexander J. Summers