Sciweavers

6251 search results - page 1222 / 1251
» Randomness, Computability, and Density
Sort
View
ASIAN
2004
Springer
153views Algorithms» more  ASIAN 2004»
14 years 12 days ago
Chi-Square Matrix: An Approach for Building-Block Identification
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
Chatchawit Aporntewan, Prabhas Chongstitvatana
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
14 years 12 days ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
CIT
2006
Springer
14 years 11 days ago
A new collision resistant hash function based on optimum dimensionality reduction using Walsh-Hadamard transform
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
Barzan Mozafari, Mohammad Hasan Savoji
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 11 days ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 11 days ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
« Prev « First page 1222 / 1251 Last » Next »