Sciweavers

5387 search results - page 394 / 1078
» Generating generic functions
Sort
View
ECCC
2007
62views more  ECCC 2007»
15 years 6 months ago
Space Hierarchy Results for Randomized and Other Semantic Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
Jeff Kinne, Dieter van Melkebeek
EOR
2007
68views more  EOR 2007»
15 years 6 months ago
Multiattribute electronic procurement using goal programming
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...
S. Kameshwaran, Y. Narahari, Charles H. Rosa, Deva...
GRID
2007
Springer
15 years 6 months ago
The Requirements of Using Provenance in e-Science Experiments
In e-Science experiments, it is vital to record the experimental process for later use such as in interpreting results, verifying that the correct process took place or tracing whe...
Simon Miles, Paul T. Groth, Miguel Branco, Luc Mor...
CORR
2004
Springer
140views Education» more  CORR 2004»
15 years 6 months ago
Integrating Defeasible Argumentation and Machine Learning Techniques
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
Sergio Alejandro Gómez, Carlos Iván ...
TIT
1998
69views more  TIT 1998»
15 years 6 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.