Sciweavers

2743 search results - page 77 / 549
» Minimization of an M-convex Function
Sort
View
ERLANG
2003
ACM
14 years 2 months ago
Evaluating distributed functional languages for telecommunications software
The distributed telecommunications sector not only requires minimal time to market, but also software that is reliable, available, maintainable and scalable. High level programmin...
Jan Henry Nyström, Philip W. Trinder, David J...
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 2 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
INFOCOM
2000
IEEE
14 years 1 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
ICCAD
1997
IEEE
133views Hardware» more  ICCAD 1997»
14 years 1 months ago
Functional simulation using binary decision diagrams
In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulatio...
Christoph Scholl, Rolf Drechsler, Bernd Becker
JMLR
2006
150views more  JMLR 2006»
13 years 9 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian