Sciweavers

4047 search results - page 224 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
SOFSEM
2009
Springer
16 years 3 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
ICASSP
2011
IEEE
14 years 10 months ago
Data driven model based least squares image reconstruction for radio astronomy
Image reconstruction problems in radio astronomy and other fields like biomedical imaging are often ill-posed and some form of regularization is required. This imposes user speci...
Stefan J. Wijnholds, Alle-Jan van der Veen
BMCBI
2008
170views more  BMCBI 2008»
15 years 6 months ago
A genetic approach for building different alphabets for peptide and protein classification
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
Loris Nanni, Alessandra Lumini
DRMTICS
2005
Springer
15 years 12 months ago
Algorithms to Watermark Software Through Register Allocation
Software security is a significant issue in the Internet age. In order to prevent software from piracy and unauthorized modification, many techniques have been developed. Softwar...
William Zhu, Clark D. Thomborson
ICML
1994
IEEE
15 years 10 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer