Sciweavers

1522 search results - page 156 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
FOCS
1998
IEEE
15 years 10 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
SIMUTOOLS
2008
15 years 8 months ago
Transforming sources to petri nets: a way to analyze execution of parallel programs
Model checking is a suitable formal technique to analyze parallel programs' execution in an industrial context because automated tools can be designed and operated with very ...
Jean-Baptiste Voron, Fabrice Kordon
IJCAI
1997
15 years 7 months ago
Extracting Propositions from Trained Neural Networks
This paper presents an algorithm for extract­ ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Hiroshi Tsukimoto
JUCS
2006
101views more  JUCS 2006»
15 years 6 months ago
DS/CDMA Multiuser Detection with Evolutionary Algorithms
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Fernando Ciriaco, Taufik Abrão, Paul Jean E...
4OR
2004
79views more  4OR 2004»
15 years 6 months ago
Constrained auction clearing in the Italian electricity market
Most of the liberalized electricity systems use the auction as a market model. The complexity of the underlying optimization formulation depends on the technical and regulatory con...
Patrizia Beraldi, Domenico Conforti, Chefi Triki, ...