Sciweavers

288 search results - page 43 / 58
» Interactive Termination Proofs Using Termination Cores
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
DSRT
2009
IEEE
15 years 1 months ago
Statemachine Matching in BOM Based Model Composition
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
Imran Mahmood, Rassul Ayani, Vladimir Vlassov, Far...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
ICTAC
2009
Springer
14 years 7 months ago
Automatic Conflict Detection on Contracts
Abstract. Many software applications are based on collaborating, yet competing, agents or virtual organisations exchanging services. Contracts, expressing obligations, permissions ...
Stephen Fenech, Gordon J. Pace, Gerardo Schneider
DFMA
2005
IEEE
151views Multimedia» more  DFMA 2005»
15 years 3 months ago
MUMOC: An Active Infrastructure for Open Video Caching
Advances in networking and content delivery systems are enabling new challenging provisioning scenarios where a growing number of users access Video on Demand (VoD), possibly whil...
Paolo Bellavista, Antonio Corradi, Luca Foschini