Sciweavers

1146 search results - page 121 / 230
» Finite cupping sets
Sort
View
HASE
2008
IEEE
14 years 4 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
14 years 4 months ago
A hybrid GA for a supply chain production planning problem
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Masoud Jenabi, S. Ali Torabi, S. Afshin Mansouri
ATVA
2006
Springer
112views Hardware» more  ATVA 2006»
14 years 1 months ago
Synthesis for Probabilistic Environments
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
Sven Schewe
ICALP
2000
Springer
14 years 1 months ago
Generating Partial and Multiple Transversals of a Hypergraph
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 1 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski