Sciweavers

1760 search results - page 147 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ICWS
2003
IEEE
13 years 9 months ago
Application of Linear Logic to Web Service Composition
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
Jinghai Rao, Peep Küngas, Mihhail Matskin
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
14 years 3 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
ETS
2006
IEEE
129views Hardware» more  ETS 2006»
14 years 2 months ago
Dynamic Voltage Scaling Aware Delay Fault Testing
The application of Dynamic Voltage Scaling (DVS) to reduce energy consumption may have a detrimental impact on the quality of manufacturing tests employed to detect permanent faul...
Noohul Basheer Zain Ali, Mark Zwolinski, Bashir M....
ICPR
2006
IEEE
14 years 9 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...