Sciweavers

2905 search results - page 426 / 581
» Formal Memetic Algorithms
Sort
View
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 8 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
WCRE
1999
IEEE
15 years 8 months ago
Experiments with Clustering as a Software Remodularization Method
As valuable software systems get old, reverse engineering becomes more and more important to the companies that have to maintain the code. Clustering is a key activity in reverse ...
Nicolas Anquetil, Timothy Lethbridge
AISC
1998
Springer
15 years 8 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
AIPS
2000
15 years 5 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
BMCBI
2010
138views more  BMCBI 2010»
15 years 4 months ago
UFFizi: a generic platform for ranking informative features
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...