Sciweavers

9787 search results - page 753 / 1958
» A Utile Function Optimizer
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 8 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
WCE
2007
15 years 8 months ago
Game Theory Using Genetic Algorithms
—In this paper we used genetic algorithms to1 find the solution of game theory. We proposed new method foe solving game theory and find the optimal strategy for player A or playe...
Ismail A. Ismail, Nabawia A. El Ramly, M. M. El Ka...
FUIN
2006
95views more  FUIN 2006»
15 years 7 months ago
Bounds for Validation
In this paper we derive the bounds for Validation (known also as Hold-Out Estimate and Train-and-Test Method). We present the best possible bound in the case of 0-1 valued loss fun...
Wojciech Jaworski
ISCI
2008
102views more  ISCI 2008»
15 years 7 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
ENTCS
2007
122views more  ENTCS 2007»
15 years 7 months ago
Plugging a Space Leak with an Arrow
The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations usi...
Hai Liu, Paul Hudak